Publisher Summary The traveling salesman problem, TSP for short, has model character in
many branches of mathematics, computer science, and operations research. Heuristics …

Heuristic optimization algorithms seek good feasible solutions to optimization problems in
circumstances where the complexities of the problem or the limited time available for …

An algorithm is described for solving large-scale instances of the Symmetric Traveling
Salesman Problem (STSP) to optimality. The core of the algorithm is a “polyhedral” cutting …

Numerous transportation applications as diverse as capital investment decision-making,
vehicle fleet planning, and traffic light signal setting all involve some form of (discrete choice) …

We present a new branch-and-cut algorithm for the capacitated vehicle routing problem
(CVRP). The algorithm uses a variety of cutting planes, including capacity, framed capacity …

The Vehicle Routing Problem (VRP) is a hard and well-known combinatorial optimization
problem which calls for the determination of the optimal routes used by a fleet of vehicles …

This thesis introduces the novel paradigm of" constraint integer programming"(CIP), which
integrates constraint programming (CP) and mixed integer programming (MIP) modeling …

Publisher Summary This chapter describes vehicle routing problem (VRP) as the problem of
designing optimal delivery routes from one or more depots to a set of geographically …

Following the theoretical studies of JB Robinson and HW Kuhn in the late 1940s and the
early 1950s, GB Dantzig, R. Fulkerson, and SM Johnson demonstrated in 1954 that large …

The capacitated vehicle routing problem (CVRP) is the problem in which a set of identical
vehicles located at a central depot is to be optimally routed to supply customers with known …