A comparison of recombination operators for capacitate vehicle routing problem

The Vehicle Routing Problem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. In this paper we study the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of t...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Graglia, Patricia, Stark, Natalia, Alfonso, Hugo, Salto, Carolina
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2008
Materias:	Ciencias Informáticas capacitated vehicle routing problem recombination genetic algorithms
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/21690
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

An Ant Colony Algorithm for the Capacitated Vehicle Routing
por: Mazzeo, S., et al.

An Ant Colony Algorithm for the Capacitated Vehicle Routing
por: Mazzeo, Silvia Noemí, et al.
Publicado: (2004)

BRKGA algorithm for the Capacitated Arc Routing Problem
por: Martinez, C., et al.
Publicado: (2011)

BRKGA algorithm for the Capacitated Arc Routing Problem
por: Martinez, C., et al.
Publicado: (2011)

BRKGA algorithm for the Capacitated Arc Routing Problem
por: Martinez, C., et al.

BRKGA algorithm for the Capacitated Arc Routing Problem
por: Loiseau, Irene
Publicado: (2011)

Algoritmos celulares con operadores específicos para resolver un problema de ruteo de vehículos
por: Bermúdez, Carlos, et al.
Publicado: (2009)

A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
por: Miranda Bront, Juan José, et al.
Publicado: (2023)

An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
por: Balseiro, S.R., et al.

An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
por: Loiseau, Irene
Publicado: (2011)

A comparison of different recombination operators for the 2-dimensional strip packing problem
por: Salto, Carolina
Publicado: (2006)

Logística inversa de residuos agroquímicos en Argentina: resolución heurística y exacta
por: Cavallin, Antonella, et al.
Publicado: (2017)

The optimal routing problem in multicomputer networks: an evolutionary approach
por: Hernández, José Luis, et al.
Publicado: (1998)

A self-adaptive recombination method in evolutionary algorithms for solving epistatic problems
por: Stark, Natalia, et al.
Publicado: (2011)

Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets
por: García, Emilio, et al.
Publicado: (2024)

Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets
por: García, Emilio, et al.
Publicado: (2024)

A branch-and-price method for the Vehicle Routing Problem with Cross-Docking and Time Windows
por: Dondo, Rodolfo
Publicado: (2013)

Biased random key genetic algorithm con búsqueda local para el Team Orienteering Problem
por: Lix-Klett, Alejandro Federico
Publicado: (2018)

Biased random key genetic algorithm con búsqueda local para el Team Orienteering Problem
por: Lix-Klett, Alejandro Federico
Publicado: (2018)

An iterative solution approach for truck routing and scheduling in the forest industry
por: Bordón, Maximiliano, et al.
Publicado: (2018)

Algorithms for the on-line travelling salesman
por: Ausiello, G., et al.

Algorithms for the on-line travelling salesman
Publicado: (2001)

Un algoritmo basado en generacion de columnas para Star Routing
por: Nostrala Hatz, Nahuel Martín
Publicado: (2023)

Un algoritmo basado en generacion de columnas para Star Routing
por: Nostrala Hatz, Nahuel Martín
Publicado: (2023)

Adapting PALS to solve VRP with Time Windows
por: Bermúdez, Carlos, et al.
Publicado: (2023)

An integer programming approach to a real-world recyclable waste collection problem in Argentina
por: Braier, G., et al.

An integer programming approach to a real-world recyclable waste collection problem in Argentina
por: Durán, Guillermo A., et al.
Publicado: (2017)

methodology to solve the problem of vehicle routing with simultaneous deliveries and collections - VRPSPD using the genetic algorithm of Chu - Beasley combined with exact techniques
por: Ballesteros Silva, Pedro, et al.
Publicado: (2018)

Star Routing : entre ruteo de vehículos y vertex cover
por: Tagliavini Ponce, Guido
Publicado: (2017)

Star Routing : entre ruteo de vehículos y vertex cover
por: Tagliavini Ponce, Guido
Publicado: (2017)

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
por: Bonomo, F., et al.
Publicado: (2011)

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
por: Bonomo, F., et al.

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
por: Bonomo, Flavia
Publicado: (2011)

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
por: Bonomo, F., et al.
Publicado: (2011)

AN AODV-based clustering and routing scheme for mobile ad hoc networks
por: Denko, Mieso K., et al.
Publicado: (2006)

A cluster-first route-second approach for the swap body vehicle routing problem
por: Miranda-Bront, J.J., et al.

A cluster-first route-second approach for the swap body vehicle routing problem
por: Miranda Bront, Juan José, et al.
Publicado: (2017)

Planificación dinámica de despachos de alimentos saludables en la ciudad de Santa Fe
por: Vitale, Ignacio, et al.
Publicado: (2019)

Dynamic routing balancing on InfiniBand network
por: Lugones, Diego, et al.
Publicado: (2008)

Modelos de programación entera para el routing and spectrum allocation problem
por: Bertero, Federico, et al.
Publicado: (2016)