A min-max vehicle routing problem with split delivery and heterogeneous demand

2013-10-01
Yakici, Ertan
Karasakal, Orhan
In this article, we introduce a new variant of min-max vehicle routing problem, where various types of customer demands are satisfied by heterogeneous fleet of vehicles and split delivery of services is allowed. We assume that vehicles may serve one or more types of service with unlimited service capacity, and varying service and transfer speed. A heuristic solution approach is proposed. We report the solutions for several test problems.
OPTIMIZATION LETTERS

Suggestions

The single-vehicle routing problem with unrestricted backhauls
Süral, Haldun (2003-05-01)
Suppose that a private carrier delivers to a set of customers and also has a number of (optional) backhaul opportunities. It wants to choose the best of these, depending on the revenue generated, and insert them in a revised tour. This will be at an expense of deviation from the original tour, because, here, deliveries need not precede backhauls. The problem is to find the mixed tour whose net cost is the lowest, selecting the most profitable backhauls subject to the overall capacity. We thus generalize sev...
A computation-implementation parallelization approach to the vehicle loading and routing problem
Çavdar, Bahar; Sokol, Joel (Wiley, 2019-01-01)
In this article, we address a version of the capacitated vehicle routing problem where there is a constraint on the total time that can be spent on computing delivery routes and loading the vehicles. This problem, which we call the vehicle loading and routing problem (VLRP), can arise, for example, in the delivery of small, quick-turnaround orders from a warehouse. We propose a computation-implementation parallelization (CIP) approach to solving large VLRP instances, and present computational results showin...
A self-organizing neural network approach for the single AGV routing problem
Soylu, M; Özdemirel, Nur Evin; Kayaligil, S (2000-02-15)
In this research, a special form of Automated Guided Vehicle (AGV) routing problem is investigated. The objective is to find the shortest tour for a single, free-ranging AGV that has to carry out multiple pick and deliver (P&D) requests. This problem is an incidence of the asymmetric traveling salesman problem which is known to be NP-complete. An artificial neural network algorithm based on Kohonen's self-organizing feature maps is developed to solve the problem, and several improvements on the basic featur...
An iterative hub location and routing problem for postal delivery systems
Çetiner, Selim; Sepil, Canan; Süral, Haldun; Department of Industrial Engineering (2003)
In this study, we consider the Turkish postal delivery system and develop an effective solution approach for the combined hub location and routing problem where the location of hub nodes are determined, the nonhub regional postal offices are allocated to the hubs, and the optimal set of routes are determined for each hub. Since the realized post-routing distances between origin-destination pairs are different from those used in the hub-location model, we develop an algorithm that finds the route-compatible ...
A column generation approach for the location-routing problem with time windows
Farham, Mohammad Saleh; Süral, Haldun; İyigün, Cem (2018-02-01)
The location-routing problem with time windows consists of opening a subset of depots, assigning customers to depots, and determining routes within allowable times such that the sum of depot opening, vehicle usage, and traveling costs is minimized. Customers have to be visited only once during their time windows and depot capacities and load limits of vehicles cannot be violated. In order to find the exact solution to the problem, we propose a branch-and-price algorithm based on set-partitioning approach. T...
Citation Formats
E. Yakici and O. Karasakal, “A min-max vehicle routing problem with split delivery and heterogeneous demand,” OPTIMIZATION LETTERS, pp. 1611–1625, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64818.