Information Technology Reference
In-Depth Information
the inherent problem diculty, we have proposed a metaheuristic framework
to obtain feasible solutions of good quality. The heuristic and its components
were empirically assessed over a wide range of instances. When compared to
current practice, it was found that the proposed method obtained solutions of
better quality in very reasonable times. The different local search neighborhoods
explored in this study can be improved if they can be cast into a more sophisti-
cated local search engine such as tabu search or variable neighborhood search,
for instance. This is a subject of follow-up work.
Acknowledgements.
This work was improved thanks to the remarks by two
anonymous reviewers. This work was supported by the Mexican Council for Sci-
ence and Technology (CONACYT), grant CB2011-1-166397, and UANL under
its Scientific and Technological Research Support Program, grants IT511-10,
CE728-11, and HU769-11. The research of the third author has been funded by
a scholarship for graduate studies from CONACYT.
References
1. Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and de-
livery problems: A classification scheme and survey. TOP 15(1), 1-31 (2007)
2. Castrillon-Escobar, A.: Una Metaheurıstica para un Problema de Carga y Descarga
en la Reparticion de Bebidas Embotelladas. Master thesis, Universidad Autonoma
de Nuevo Leon, San Nicolas de los Garza, Mexico (March 2013) (in Spanish)
3. Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F., Vogel, U.: Vehi-
cle routing with compartments: Applications, modelling and heuristics. OR Spec-
trum 33(4), 885-914 (2011)
4. Drexl, M.: Applications of the vehicle routing problem with trailers and transship-
ments. European Journal of Operational Research 227(2), 275-283 (2013)
5. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Jour-
nal of Global Optimization 6(2), 109-133 (1995)
6. Mitrovic-Minic, S., Laporte, G.: Waiting strategies for the dynamic pickup and de-
livery problem with time windows. Transportation Research 38(7), 635-655 (2004)
7. Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery prob-
lems, part II: Transportation between pickup and delivery locations. Journal fur
Betriebswirtschaft 58(2), 81-117 (2008)
8. Qu, Y., Bard, J.F.: The heterogeneous pickup and delivery problem with con-
figurable vehicle capacity. Transportation Research Part C: Emerging Technolo-
gies 32(1), 1-20 (2013)
9. Ropke, S., Cordeau, J.F.: Branch and cut and price for the pickup and delivery
problem with time windows. Transportation Science 43(3), 267-286 (2009)
10. Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the
pickup and delivery problem with time windows. Transportation Science 40(4),
455-472 (2006)
