Este artículo presenta una revisión bibliográfica acerca de la histo-ria, tipologías y métodos
de solución del Problema de Ruteo de Vehículos (VRP). Explica las diferentes variaciones …

Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global
optimization problems whose basic idea is a systematic change of neighborhood both within …

This paper addresses a vehicle scheduling problem encountered in home health care
logistics. It concerns the delivery of drugs and medical devices from the home care …

The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing
Problem (VRP) are one of the most widely studied problems in combinatorial optimization. It …

Due to the growing concern over environmental issues, regardless of whether companies
are going to voluntarily incorporate green policies in practice, or will be forced to do so in the …

The purpose of this paper is to introduce the area of Green Logistics and to describe some of
the problems that arise in this subject which can be formulated as combinatorial optimization …

Abstract The Capacitated Arc Routing Problem or CARP arises in applications like waste
collection or winter gritting. Metaheuristics are tools of choice for solving large instances of …

The purpose of this paper is to introduce the area of Green Logistics and to describe some of
the problems that arise in this subject which can be formulated as combinatorial optimization …

After a natural disaster roads can be damaged or blocked by debris, while bridges and
viaducts may collapse. This commonly observed hazard causes some road sections to be …

The capacitated arc routing problem (CARP) is a challenging combinatorial optimization
problem with many real-world applications, eg, salting route optimization and fleet …