Procedimientos exactos y heurísticos para resolver problemas de rutas con recogida y entrega de mercancía

Hipólito Hernández Pérez · Dialnet (Universidad de la Rioja) · 2004

Explore this paper's citation graph

Summary

Desarrollos teoricos y algoritmos son dados para the generalizacion del 1-PDTSP a varias mercancias.

Type: article
Published: 2004-01-01
Cited by: 5
References: 51
OpenAlex: https://openalex.org/W97509452
Semantic Scholar: https://api.semanticscholar.org/CorpusID:124795401

Keywords

Travelling salesman problem, Resolver, Pickup, Computer science, Vehicle routing problem

References

The traveling salesman problemGregory Gutin, Abraham P. Punnen — 2006
Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic ProgrammingLucio Bianco, Aristide Mingozzi, Salvatore Ricciardelli — 1994
Handbooks in operations research and management scienceGeorge L. Nemhauser, A. H. G. Rinnooy Kan — 1989
Graphs and HypergraphsC. Berge — 2021
The Vehicle Routing ProblemPaolo Toth, Daniele Vigo — 2002
A Request Clustering Algorithm for Door-to-Door Handicapped TransportationIrina Ioachim, Jacques Desrosiers, Yvan Dumas — 1991
The pickup and delivery problem: Faces and branch-and-cut algorithmK.S. Ruland, Ervin Y. Rodin — 1997
New facets for the set packing polytopeLázaro Cánovas, Mercedes Landete, Alfredo Marı́n — 2000
Heuristic Algorithms for the Handicapped Persons Transportation ProblemPaolo Toth, Daniele Vigo — 1997
Linear Programming—1: IntroductionU Dave — 1998
The traveling salesman problem with delivery and backhaulsShoshana Anily, Gur Mosheiov — 1994
Heuristics for the traveling salesman problem with pickup and deliveryMichel Gendreau, Gilbert Laporte, Daniele Vigo — 1999
Routing a Vehicle of Capacity Greater than oneD.J. Guan — 1998
The Swapping Problem on a LineShoshana Anily, Michel Gendreau, Gilbert Laporte — 1999
On the facial structure of set packing polyhedraManfred Padberg — 1973
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithmsJean-Fran�ois Cordeau, Gilbert Laporte — 2003
An effective implementation of the Lin-Kernighan traveling salesman heuristicKeld Helsgaun — 2000
A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride ProblemHarilaos N. Psaraftis — 1980
Approximating Capacitated Routing and Delivery ProblemsPrasad Chalasani, Rajeev Motwani — 1999
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsManfred Padberg, Giovanni Rinaldi — 1991

Cited by

Application of the graph theory on the solution of environmental problemsA. A. C. Espinal, J. Flórez, Juan Salazar López — 2011
Capacitated vehicle routing problem for PSS uses based on ubiquitous computing: An emerging markets approachAlberto Ochoa, Francisco Ornelas, Lourdes Y. Margain-Fuentes — 2015
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problemHipólito Hernández–Pérez, Inmaculada Rodríguez‐Martín, Juan‐José Salazar‐González — 2009
Bees and Genetic Algorithms: A Comparison on a Classic ProblemM. Pinninghoff, G. Alvarez, R. Contreras — 2016
Solving capacitated vehicles routing problems using graph theoryAlexander Alberto Correa Espinal, Juan Cogollo Flórez, Juan Salazar López — 2011

Related papers

No related papers recorded.