Open Access


Download data is not yet available.


As the construction activity has been growing, the companies that supply fresh concrete expand their production scale to meet their customers’ needs. The more customers, the longer queue tank trucks have to wait to pick up the fresh concrete. The customers are construction companies that have different construction works at the same time while the transportation time is only at night. They have to schedule efficiently the fleet of fresh concrete tank trucks during the night (turning the tank trucks a few turns) with constraints on the time window for the transfer of fresh concrete from the concrete company to the construction site as well as constraints on the waiting time for loading fresh concrete in the company. The scheduling for the fleet of construction company’s tank trucks will be modeled to minimize total transportation costs (fixed, variable) with estimated waiting times and tank truck’s turns several times during the night. The model of logistics problem is NP hard; Therefore, two algorithms are proposed to find the nearly optimal solution: heuristics and simulated annealing algorithm. The results will be compared and analyzed.

Author's Affiliation
Article Details

Issue: Vol 1 No Q4 (2017)
Page No.: 70-77
Published: Oct 31, 2017
Section: Research article

 Copyright Info

Creative Commons License

Copyright: The Authors. This is an open access article distributed under the terms of the Creative Commons Attribution License CC-BY 4.0., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

 How to Cite
Phan, H. (2017). A simulated annealing algorithm for vehicle scheduling problem. Science & Technology Development Journal - Economics - Law and Management, 1(Q4), 70-77.

 Cited by

Article level Metrics by Paperbuzz/Impactstory
Article level Metrics by Altmetrics

 Article Statistics
HTML = 306 times
Download PDF   = 729 times
Total   = 729 times