In this paper, we survey the literature on matheuristics proposed to solve vehicle routing
problems. A matheuristic makes use of mathematical programming models in a heuristic …

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 …

This paper aims to investigate the vehicle routing problem faced by a logistics service
provider that performs the last-mile delivery of large household appliances under the front …

7.1▪ Introduction Modern societies demand transportation systems that offer high efficiency
and comfort but also minimal noise, pollution, cost, and delays. These requirements apply to …

We address the one-to-one multicommodity pickup-and-delivery traveling salesman
problem, a challenging variant of the traveling salesman problem that includes the …

We address the one-to-one multi-commodity pickup and delivery traveling salesman
problem (m-PDTSP) which is a generalization of the TSP and arises in several …

We address in this article the multi-commodity pickup-and-delivery traveling salesman
problem, which is a routing problem for a capacitated vehicle that has to serve a set of …

This paper investigates the vehicle routing problem faced by a third‐party logistics (3PL)
provider that performs the last‐mile delivery service in omni‐channel retailing for a number …

The “multi‐commodity Pickup‐and‐Delivery Traveling Salesman Problem”(m‐PDTSP) is a
generalization of the well‐known “Traveling Salesman Problem” in which cities correspond …

The multi-commodity pickup-and-delivery traveling salesman problem (m-PDTSP) is a
variant of the classic traveling salesman problem with pickup and delivery. It arises from a …