This paper examines the plant location problem under the objective of maximizing return-on-investment. However, in place of the standard assumption that all...

Several variants and generalizations of the Or-opt heuristic for the <i>Symmetric Traveling Salesman Problem</i> are developed and compared on random and pla...

This article reviews some of the best metaheuristics proposed in recent years for the Vehicle Routing Problem. These are based on local search, on populatio...

The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a ...

In this study we develop optimization, decomposition, and heuristic procedures to design a unidirectional loop flow pattern along with the pickup and delive...

A sizeable proportion of manufacturing expenses can be attributed to facility layout and material handling. Facility layout decisions involve designing the ...

In the <i>m</i>-Peripatetic Salesman Problem</i> (<i>m</i>-PSP) the aim is to determine <i>m</i> edge disjoint Hamiltonian cycles of minimum total cost on a ...

This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing pr...

Corrected Miller-Tucker-Zemlin type subtour elimination constraints for the Capacitated Vehicle Routing Problem are presented.

This article describes a tabu search heuristic for the <i>Dial-a-Ride Problem</i> with the following characteristics. Users specify transportation requests ...

The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pick-up and drop-off requests betwee...

In the undirected <i>Hierarchical Chinese Postman Problem</i> (HCPP), the edges of a graph are partitioned into clusters and must be serviced while respecti...

The <i>Job Sequencing and Tool Switching Problem</i> (SSP) involves optimally sequencing jobs and assigning tools to a capacitated magazine in order to mini...

This article considers the (1|<i>X_p</i>-medianoid problem on a network <i>N</i>=(<i>V,E</i>) with vertex and edge demands. There are already <i>p...

In the <i>Maximum Cardinality Bin Packing Problem</i>, we are given <i>m</i> bins of capacity <i>c</i> and <i>n</i> items of weights <i>w_i</i> (...

This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first desc...

The purpose of this article is to describe several applications of the Clustered Traveling Salesman Problem arising in areas as diverse as vehicle routing, ...

This paper investigates several questions related to the location of facilities in multi-storey buildings in the presence of lifts. Where should facilities ...

Rotating work schedules are encountered in several industries and public sector organizations where work is carried out 24 hours a day, seven days a week. ...

This article traces the evolution of ambulance location and relocation models proposed over the past thirty years. The models are classified in two main ca...