In this paper, we consider vehicle routing problems with backhauls and time windows (VRPBTW). Different backhaul variants are studied, namely clustered backhauls (CB), mixed linehauls and backhauls, and variants with simultaneous delivery and pickup and with divisible delivery and pickup. Three dimensional loading constraints are assumed. A two-phase approach following the principle packing fir...

Cooperative Pickup and Delivery Problem (PDP), as a variant of the typical Vehicle Routing Problems (VRP), is an important formulation in many real-world applications, such on-demand delivery, industrial warehousing, etc. It great importance to efficiently provide high-quality solutions cooperative PDP. However, it not trivial effective directly due two major challenges: 1) structural dependenc...

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...

This paper studies the integration of vehicle routing problem with cross-docking (VRPCD). The aim is to find a set routes deliver products from suppliers customers through cross-dock facility, such that operational and transportation costs are minimized, without violating capacity time horizon constraints. A two-phase matheuristic based on column generation proposed. first phase focuses generat...

The new emerging area of Enterprise Wide Optimization (EWO) has focused the attention in effectively solving the combined producion/distribution scheduling problem. The importance of logistic activities performed in multi-site environments comes from the relative magnitude f the associated transportation costs and the good chance of getting large savings on such expenses. This paper first devel...

Customers’ expectations of timely and accurate delivery pickup online purchases pose a new challenge to last-mile delivery. When the goods sent customers are not received, they must be returned warehouse. This situation provides high additional cost. Parcel locker systems convenience stores have been launched solve this problem serve as payment stations. research investigates distribution in au...

In real-world express systems, couriers need to satisfy not only the delivery demands but also pick-up of customers. Delivery and pickup tasks are usually mixed together within integrated routing plans. Such a problem can be abstracted formulated as Vehicle Routing Problem with Mixed Pickup (VRPMDP), which is an NP-hard combinatorial optimization problem. To solve VRPMDP, there three major chal...

The vehicle routing with pickups and deliveries (VRPD) problem is de6ned over a graph G=(V; E). Some vertices in G represent delivery customers who expect deliveries from a depot, and other vertices in G represent pickup customers who have available supply to be picked up and transported to a depot. The objective is to 6nd a minimum length tour for a capacitated vehicle, which starts at a depot...