Abstract
A variant of vehicle routing problem in which customers require simultaneous pickup and delivery goods during specific individual time windows (VRPSPDTW) is addressed. A general mixed integer programming model focused on minimizing the number of vehicles is proposed. A simulated annealing (SA) algorithm is developed and applied to solve this NP-hard optimization problem. Computational results are reported for a set of 15 test problems from Wang and Chen’s benchmark and compared with the results from a genetic algorithm (GA). It is shown that SA is an effective metaheuristic to solve the VRPSPDTW.
Author supplied keywords
Cite
CITATION STYLE
Wang, C., Zhao, F., Mu, D., & Sutherland, J. W. (2013). Simulated annealing for a vehicle routing problem with simultaneous pickup-delivery and time windows. In IFIP Advances in Information and Communication Technology (Vol. 415, pp. 170–177). Springer New York LLC. https://doi.org/10.1007/978-3-642-41263-9_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
