Arc routing problems (ARPs) are defined and introduced. Following a brief history of
developments in this area of research, different types of ARPs are described that are …

Vehicle routing problems have drawn researchers' attention for more than 50 years. Most
approaches found in the literature address these problems using the so‐called customer …

Mergers and acquisitions (M&A) in the hospitality sector involve consolidating assets among
hotels through partnerships. While data envelopment analysis (DEA) has been widely used …

In this work we investigate the problem of order batching and picker routing in storage areas.
These are labour and capital intensive problems, often responsible for a substantial share of …

The Steiner Traveling Salesman Problem (STSP) is a variant of the TSP that is particularly
suitable when routing on real-life road networks. The standard integer programming …

The capacitated arc-routing problem with stochastic demands (CARPSD) is an extension of
the well-known capacitated arc-routing problem (CARP) in which demands are stochastic …

Arc Routing is the arc counterpart to node routing in the sense that focus regarding service
and resource constraints are on the arcs and not on the nodes. The key problem within this …

This paper proposes a simheuristic algorithm for solving the Arc Routing Problem with
Stochastic Demands. Our approach combines Monte Carlo Simulation (MCS) with the …

This paper examines the potential of Mergers & Acquisitions (M&As) as a novel approach to
energy use optimization. The investigations are carried out through inverse data …

This paper investigates a new variant of the consistent vehicle routing problem considering
path consistency based on the underlying road network (ConVRP RN). It is the problem of …