Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study

Abstract

informa que el(los) autor(es) ha(n) autorizado a usuarios internos y externos de la institución a consultar el contenido de este documento a través del Catálogo en línea de la Biblioteca y el Repositorio Institucional en la página Web de la Biblioteca, así como en las redes de información del país y del exterior con las cuales tenga convenio la Universidad de La Sabana.Se permite la consulta a los usuarios interesados en el contenido de este documento para todos los usos que tengan finalidad académica, nunca para usos comerciales, siempre y cuando mediante la correspondiente cita bibliográfica se le de crédito al documento y a su autor.De conformidad con lo establecido en el artículo 30 de la Ley 23 de 1982 y el artículo 11 de la Decisión Andina 351 de 1993, La Universidad de La Sabana informa que los derechos sobre los documentos son propiedad de los autores y tienen sobre su obra, entre otros, los derechos morales a que hacen referencia los mencionados artículos.

An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations

“…For example, Favaretto et al [8] extend the VRPTW to allow multiple disjoint time windows for each customer. Pellegrini et al [17] also consider multiple time windows and heterogeneous resources. In the site-dependent VRPTW (SDVRPTW) (c.f., Cordeau and Laporte [5]), each customer may be served by only a subset of the available heterogeneous resources.…”

Resource constrained routing and scheduling: Review and research prospects

“…Shao et al (2012) considered flexible and fixed customers, imposing soft and hard time windows, respectively. Pellegrini et al (2007) addressed a rich vehicle routing problem, where customers require to be serviced by a specific type of vehicle and have multiple time windows within a day and throughout the days of a week. Regarding the problem addressed by Trautsamwieser et al (2011), nurses can work several shifts per day, as long as the work force-related constraints are not violated.…”

Unified matheuristic for solving rich vehicle routing problems

“…There are also physical inclusion and exclusion restrictions as discussed in (Desrochers et al, 1990). It may occur that a customer must (not) be served from a given depot, by a given vehicle (e.g., Pellegrini et al (2007)) or a specific driver (e.g., Rieck and Zimmermann (2010)). Indeed, the vehicle requirements and the driver qualifications, such as licensing, training for transporting specific materials and knowledge about a geographical area, may limit the compatibility between driver and vehicle.…”

“…Similarly, Pellegrini (2005) focuses on a VRP with heterogeneous vehicles and multiple time windows for customers. Later on, in Pellegrini et al (2007) the authors consider multiple visits to some customers over a periodic horizon, hierarchical objectives, and additional customer requirements. In Tables 1.2 and 1.3, papers addressing different variants of the VRP are listed.…”