Optimizing routes and stock

Journal of Heuristics

Volumn 19, Issue 2, 2013, Pages 157-177

  García, Irma ^a,b   Pacheco, Joaquín ^c   Alvarez, Ada ^a  

^a UNIVERSIDAD AUTÓNOMA DE NUEVO LEÓN   (Mexico)

^b UNIVERSIDAD AUTÓNOMA DE COAHUILA   (Mexico)

^c UNIVERSITY OF BURGOS   (Spain)

Author keywords

NSGA II; VNS; VRP with flexibility in delivery

Indexed keywords

HEURISTIC ALGORITHMS; SOFTWARE ENGINEERING;

LINEAR MODELING; NSGA-II; NUMERICAL RESULTS; SPECIFIC OPERATORS; TOTAL DISTANCES; VARIABLE NEIGHBORHOOD SEARCH; VNS; VRP WITH FLEXIBILITY IN DELIVERIES;

ARTIFICIAL INTELLIGENCE;

EID: 84891057502     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-011-9182-2     Document Type: Article

References (18)

1. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
2. Beasley, J.: Route-first cluster-second methods for vehicle routing. Omega 11, 403-408 (1983)
3. Bentley, J.: Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4, 387-411 (1992)
4. Caballero, R., Gonzalez, M., Guerrero, F.M., Molina, J., Paralera, C.: Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia. Eur. J. Oper. Res. 177 (3), 1751-1763 (2007)
5. Deb, K., Pratap, A., Argwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGAII. IEEE Trans. Evol. Comput. 6, 182-197 (2002)
6. Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269-271 (1959)
7. Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Heidelberg (2005)
8. Fisher, M., Jaikumar, R.: A generalized assignment heuristics for vehicle routing problem. Networks 11, 109-124 (1981)
9. Jozefowiez, N., Semet, F., Talbi, E.-G.: From single-objective to multiobjective vehicle routing problems: Motivations, case studies, and methods. In: Golden, B.L., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 445-471. Springer, Berlin (2008a)
10. Jozefowiez, N., Semet, F., Talbi, E.-G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189, 293-309 (2008b)
11. Martello, S., Toth, P.: Knapsack Problems Algorithms and Computer Implementations. Wiley, New York (1990)
12. Or, I.: Traveling Salesman Type Combinatorial Problems and their relations to the logistics of blood banking. Dissertation, Northwestern University (1976)
13. Pacheco, J., Alvarez, A., García, I., Angel-Bello, F.: Optimizing vehicle routes in a bakery company allowing flexibility in delivery dates. J. Oper. Res. Soc. (2011). doi:10.1057/jors.2011.51
14. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31, 1985-2002 (2004)
15. Romero, C.: Teoría de la Decisión Multicriterio: Conceptos, Técnicas y Aplicaciones. Alianza Universidad Textos. Alianza Editorial, Madrid (1993)
16. Taillard, E., Badeau, P., Gendreau, M., Potvin, J.: A tabu search heuristic for the vehicle routing problem with time windows. Transp. Sci. 31, 170-186 (1997)
17. Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM. Monographs on Discrete Mathematical and Applications. SIAM, Philadelphia (2002)
18. Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3, 257-271 (1999)