This paper surveys the most effective mathematical models and exact algorithms proposed
for finding the optimal solution of the well-known Asymmetric Traveling Salesman Problem …

This introductory chapter explains the motivation for developing decision diagrams as a new
discrete optimization technology. It shows how decision diagrams implement the five main …

6.1▪ Introduction Pickup-and-Delivery Problems (PDPs) constitute an important family of
routing problems in which goods or passengers have to be transported from different origins …

Abstract The Precedence Constrained Generalized Traveling Salesman Problem (PCGTSP)
is an extension of two well-known combinatorial optimization problems—the Generalized …

Sequencing problems are among the most prominent problems studied in operations
research, with primary application in, eg, scheduling and routing. We propose a novel …

Multi-depot routing problems mainly arise in distribution logistics where a fleet of vehicles
are used to serve clients from a number of (potential) depots. The problem concerns …

The classical assembly line balancing problem consists of assigning assembly work to
workstations. In the presence of setup times that depend on the sequence of tasks assigned …

A colored traveling salesman problem (CTSP) as a generalization of the well-known multiple
traveling salesman problem utilizes colors to distinguish the accessibility of individual cities …

This paper concerns a generalization of the traveling salesman problem (TSP) called multi-
commodity one-to-one pickup-and-delivery traveling salesman problem (m-PDTSP) in which …

It is not rare that the performance of one metaheuristic algorithm can be improved by
incorporating ideas taken from another. In this article we present how Simulated Annealing …