Publication: Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
Loading...
Full text at PDC
Publication Date
2011-05-16
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Science
Citations
Exportar
Abstract
Logistics and transportation issues have been receiving increasing attention during the last decades and their requirements have gradually changed, making it necessary to take into account new situations and conditions. The Double Traveling Salesman Problem with Multiple Stacks (DTSPMS) is a pickup and delivery problem in which some additional precedence and loading constraints are imposed on the vehicle to be used. In this paper we approach the problem using intermediate infeasible solutions to diversify the search process and we develop some fixing procedures and infeasibility measures to deal with this kind of solutions and take advantage of their potential. (C) 2010 Elsevier B.V. All rights reserved.
Description
UCM subjects
Unesco subjects
Keywords
Citation
Casazza, M., Ceselli, A., Nunkesser, M. 2009. Efficient algorithms for the DTSPMS. Proceedings of the Cologne Twente Workshop in Combinatorial Optimization.
Ceselli, A., Righini, G., Tirado, G. 2009. Mathematical programming algorithms for the double TSP with multiple stacks. Proceedings of the 22nd European Chapter on Combinatorial Optimization.
Cordeau, J.F., Gendreau, M., Laporte, G., Potvin, J.Y., Semet, F., 2002. A guide to vehicle routing heuristics. The Journal of the Operational Research Society 53 (5), 512–522.
Cordeau, J.F., Laporte, G., 2003. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B 37, 579–594.
Cordeau, J.F., Laporte, G., Mercier, A., 2001. A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52, 928–936.
Côtè, J.F. , Gendreau, M., Potvin, J.Y. 2009. Large neighborhod search for the single vehicle pickup and delivery problem with multiple loading stacks. Working paper CIRRELT-2009-47. CIRRELT.
Díaz, J.A., Fernández, E., 2001. A Tabu search heuristic for the generalized assignment problem. European Journal of Operational Research 132, 22–38.
Doerner, K.F., Fuellerer, G., Hartl, R.F., Gronalt, M., Iori, M., 2007. Metaheuristics for the vehicle routing problem with loading constraints. Networks 49 (4), 294– 307.
Felipe, A., Ortuño, M.T., Tirado, G., 2009a. New neighborhood structures for the double traveling salesman problem with multiple stacks. TOP 17, 190–213.
Felipe, A., Ortuño, M.T., Tirado, G., 2009b. The double traveling salesman problem with multiple stacks: A variable neighborhood search approach. Computers and Operations Research 36, 2983–2993.
Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M., 2010. Metaheuristics for vehicle routing problems with three-dimensional loading constraints. European Journal of Operational Research 201, 751–759.
Gendreau, M., Hertz, A., Laporte, G., 1994. A tabu search heuristic for the vehicle routing problem. Management Science 40 (10), 1276–1290.
Gendreau, M., Iori, M., Laporte, G., Martello, S., 2006. A heuristic algorithm for a routing and container loading problem. Transportation Science 40, 342– 350.
Gendreau, M., Iori, M., Laporte, G., Martello, S., 2008. A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51 (1), 4–18.
Gendreau, M., Laporte, G., Musaraganyi, C., Taillard, E.D., 1999. tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers and Operations Research 26, 1153–1173.
Gendreau, M., Laporte, G., Seguin, R., 1996. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research 44 (3), 469–477.
Hanne, T., 2009. On Utilizing Infeasibility in Multiobjective Evolutionary Algorithms. In: Barichard, V., Ehrgott, M., Gandibleux, X., T’Kindt, V. (Eds.), Multiobjective Programming and Goal Programming Theoretical Results and Practical Applications, Lecture Notes in Economics and Mathematical Systems. Springer-Verlag.
Hansen, P., Mladenovic , N., Moreno Pérez, J.A., 2010. Variable neighbourhood search: Methods and applications. Annals of Operations Research 175, 367– 407.
Iori, M., Salazar-González, J., Vigo, D., 2007. An exact approach for the vehicle routing problem with two- dimensional loading constraints. Transportation Science 41 (2), 253–264.
Kimbrough, S.O., Koehler, G.J., Lu, M., Wood, D.H., 2008. On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch. European Journal of Operational Research 190, 310-327.
Lusby, R., Larsen, J., Ehrgott, M., Ryan, D. 2009. An Exact Method for the Double TSP with Multiple Stacks. Technical Report 2.2009. DTU Management Engineering.
Mladenovic , N., Hansen, P., 1997. Variable neighbourhood search. Computers and Operations Research 24, 1097– 1100.
Petersen, H.L. 2006. Heuristic Solution Approaches to the Double TSP with Multiple Stacks. Centre for Traffic and Transport, Technical Report, Technical University of Denmark.
Petersen, H., Archetti, C., Speranza, M.G. 2010. Exact solutions to the Double Travelling Salesman Problem with Multiple Stacks. Networks 2010; available online doi: 10.1002/net.20375.
Petersen, H.L., Madsen, O.B.G., 2009. The double travelling salesman problem with multiple stacks – Formulation and heuristic solution approaches. European Journal of Operational Research 198 (1), 139–147.
Tirado, G. 2009. El Doble Problema del Viajante con Multiples Pilas. PhD Thesis; University Complutense of Madrid, Spain.
Toulouse, S., Wolfler Calvo, R. 2009. On the Complexity of the Multiple Stack TSP, kSTSP. Lecture Notes In Computer Science 2009; Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation table of contents Changsha, China; 5532; pp. 360–369.
Yu, Y., Zhou, Z.H. 2008. On the Usefulness of Infeasible Solutions in Evolutionary Search: A Theoretical Study. IEEE Congress on Evolutionary Computation (CEC 2008).