Hubbing and routing in postal delivery systems

Date

2010-12-01

Author

Cetiner, Selim
Sepil, Canan
Süral, Haldun

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

191
views

0
downloads

We consider the combined hubbing and routing problem in postal delivery systems and develop an iterative two-stage solution procedure for the problem. In the first stage, hub locations are determined and postal offices are multiply allocated to the hubs. The second stage gives the routes in hub regions that alter the distances between points used in the hub-location problem. The procedure then iterates between two stages by updating the distances used in hubbing in order to produce a route-compatible hub configuration. Computational experience is reported for the test problems taken from the literature. For a case study Turkish postal delivery system data are utilized. As the case study is applied on a road network, a final stage, seeking improvements based on special structures in the routed network, is appended to the two-stage solution procedure.

Subject Keywords

Location, Vehicle routing, Heuristics

URI

https://hdl.handle.net/11511/39816

Journal

ANNALS OF OPERATIONS RESEARCH

DOI

https://doi.org/10.1007/s10479-010-0705-2

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

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 ...
Local search heuristics for pollution-routing problem with multiple vehicle types and deadlines Saka, Onur Can; Gürel, Sinan; Van Woensel, Tom; Department of Industrial Engineering (2013) Vehicle Routing Problem (VRP) is one of the most widely studied problems in logistics literature. Up to now, many different types of exact solution methods and heuristics have been developed in order to deal with various variants of this computationally complex optimization problem. However, only a few researchers have included the concepts of speed control, fuel consumption and greenhouse gas (GHG) emissions in their studies. The first part of this study is dedicated to a special variant of VRP called the ...
A min-max vehicle routing problem with split delivery and heterogeneous demand Yakici, Ertan; Karasakal, Orhan (2013-10-01) 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.
TSP Race: Minimizing completion time in time-sensitive applications Çavdar, Bahar; Sokol, Joel (2015-07-01) In this paper, we present an approach for parallelizing computation and implementation time for problems where the objective is to complete the solution as soon after receiving the problem instance as possible. We demonstrate the approach on the TSP. We define the TSP race problem, present a computation-implementation parallelized (CIP) approach for solving it, and demonstrate CIP's effectiveness on TSP Race instances. We also demonstrate a method for determining a priori when CIP will be effective. Althoug...
Using cost change estimates in a local search heuristic for the pollution routing problem SAKA, Onur Can; Gürel, Sinan; Van Woensel, Tom (2017-03-01) We consider the pollution routing problem (PRP) with deadlines and heterogeneous fleet for which we implement a local search heuristic using inter-route relocate, exchange and intra-route relocate moves. The subproblem of finding optimal speed levels of a truck for a given tour gives optimality properties which relate the marginal speedup costs for each leg on the tour. We use the derived optimality properties and marginal speedup costs to evaluate possible search moves and choose the most promising ones to...

Citation Formats

S. Cetiner, C. Sepil, and H. Süral, “Hubbing and routing in postal delivery systems,” ANNALS OF OPERATIONS RESEARCH, pp. 109–124, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39816.