Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

The current global interest in improving the use of ever-scarcer natural resources calls for
the re-alignment of supply chain operations to include not only economic factors, but …

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 …

Distributors are faced with loading constraints in their route planning, eg, multi-dimensional
packing constraints, unloading sequence constraints, stability constraints and axle weight …

In this paper, we consider that a private company has developed a platform to provide
intercity ride-sharing (IRS) services for riders between two cities. The riders between the two …

Job shop scheduling problem (JSP) which is widespread in the real-world production
system is one of the most general and important problems in various scheduling problems …

In this paper a new heuristic is proposed to solve general multi-level lot-sizing and
scheduling problems. The idea is to cross-fertilize the principles of the meta-heuristic …

In this paper, we introduce and study the capacitated vehicle routing problem with sequence-
based pallet loading and axle weight constraints. To the best of our knowledge, it is the first …

We extend the traveling salesman problem with pickup and delivery and LIFO loading
(TSPPDL) by considering two additional factors, namely the use of multiple vehicles and a …

Abstract The Double Traveling Salesman Problem with Multiple Stacks (DTSPMS) is a one-
to-one pickup-and-delivery single-vehicle routing problem with backhaul deliveries. The …