Abstract
This work is motivated by a real problem posed to the authors by a company in Tenerife, Spain. Given a set of service orders,daily routes have to be designed in order to minimize the total traveled distance while balancing the workload of drivers in terms of required time. A bi-objective mixed-integer linear model for the problem is formulated and a solution approach, based on metaheuristics, is proposed. One the main handicaps associated to this approach is the fact that it is very time consuming for non-standard literature instances, mainly due to the the initial solution generation method. Therefore, the goal of this work is to study the performance of three different ways to build the initial solutions and observe what is their impact on the approximations of the Pareto Front for Solomon instances of 100 customers. Results obtained on a real instance are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Beasley, J.E.: Route First-Cluster Second Methods for Vehicle Routing. Omega 1, 403–408 (1983)
Coello Coello, C., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary algorithms for solving multiobjective problems. Kluwer, New York (2002)
Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. European Journal of Operational Research 189(2), 293–309 (2008)
Kumar, S.N., Panneerselvam, R.: A Survey on the Vehicle Routing Problem and Its Variants. Intelligent Information Management 4(3), 66–74 (2012)
Molina, J., Laguna, M., Mart, R., Caballero, R.: SSPMO: A Scatter Tabu Search Procedure for Non-linear Multiobjective Optimization. INFORMS Journal on Computing 19(1), 91–100 (2007)
Ngueveu, S.U., Prins, C., Wolfler-Calvo, R.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research 37, 1877–1885 (2010)
Solomon, M.M.: Algorithms for the Vehicle-Routing and Scheduling Problems with Time Window Constraints. Operations Research 35(2), 254–265 (1987)
Potvin, J.Y., Rousseau, J.M.: A Parallel Route Building Algorithm for the Vehicle-Routing and Scheduling Problem with Time Windows. European Journal of Operational Research 66(3), 331–340 (1993)
Melián, B., De Santiago, A., AngelBello, F., Álvarez, A.: A Bi-objective Vehicle Routing Problem with Time Windows: a real case in Tenerife. Under Second Review in a Journal (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Santiago, A., Melián-Batista, B., Álvarez, A., AngelBello, F. (2013). Effect of the Initial Solutions to Balance Routes in Vehicle Routing Problem with Time Windows. In: Rojas, I., Joya, G., Cabestany, J. (eds) Advances in Computational Intelligence. IWANN 2013. Lecture Notes in Computer Science, vol 7903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38682-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-38682-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38681-7
Online ISBN: 978-3-642-38682-4
eBook Packages: Computer ScienceComputer Science (R0)