This paper presents a new metahaheuristic algorithm to solve the capacitated locationrouting problem (CLRP). We are given on input a set of identical vehicles, a set of depots with restricted capacities and opening costs, and a set of customers with deterministic demands. The problem consists of determining the depots to be opened, the customers and the vehicles to be assigned to each open depo...

In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants the Capacitated Arc Routing Problem with Intermediate Facilities (CARPIF) and the Capacitated Arc Routing Problem with Intermediate Facilities and Length restrictions (CLARPIF). Routing problems represent one of the most prominent classes of mode...

An optimal evacuation route plan has to be established to overcome the problem of poor coordination and uneven distribution of vehicles before or during disaster. This article introduces the evacuation vehicle routing problem (EVRP) as a new variant to the vehicle routing problem (VRP). EVRP is a process of moving vehicles from a vehicle location to the potentially flooded area (PFA), and from ...

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...

ABSTRACT. POPMUSIC — Partial optimization metaheuristic under special intensification conditions — is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like p-median, sum of squares clustering, vehicle routing and map labeling. In terms of algorithmic complexity, one of the most complex part of POPMUSIC template...

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

We consider a network design problem that arises in the costoptimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem We refer to it as the Capacitated Con...