Routing problems, such as the traveling salesman problem and the vehicle routing problem,
are widely studied both because of their classic academic appeal and their numerous real …

In this paper we present a review of approximative solution methods, that is, heuristics and
metaheuristics designed for the solution of multiobjective combinatorial optimization …

The Vehicle Routing Problem (VRP) was first proposed by Dantzig and Ramser in 1959 [1].
It is defined on a network, in which the points represent the depot and customers and the …

In this paper, we present a solution method for a bi-objective vehicle routing problem, called
the vehicle routing problem with route balancing (VRPRB), in which the total length and …

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop
routes from the earliest feasible departure time. In practice, however, temporary traffic …

List of References on Evolutionary Multiobjective Optimization Page 1 List of References on
Evolutionary Multiobjective Optimization Carlos A. Coello Coello ccoello@cs.cinvestav.mx …

Distribution companies that serve a very large number of customers, courier companies for
example, often partition the geographical region served by a depot into zones. Each zone is …

G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY
ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR …

A particular vehicle routing problem is considered: a customer asks to load a quantity at one
place and to tran sport it to another one. The aim is to determine the daily routes of a fleet of …

This paper addresses the vehicle routing problem with time windows (VRPTW). The task is
to assign customers to multiple vehicles and determine the visiting sequences of customers …