Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
An iterative hub location and routing problem for postal delivery systems
Download
143181.pdf
Date
2003
Author
Çetiner, Selim
Metadata
Show full item record
Item Usage Stats
226
views
0
downloads
Cite This
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 hub configuration and allocation paths. The algorithm is the one that iterates between the hub-location phase and a routing phase. Our strategy consists of updating the distances used in the first phase in order to produce a solution that contains the cognition of routes. Some special structures in the routed n etwork are also identified and used for improving the solution. Computational experience is reported.
Subject Keywords
Postal services
,
Turkey
,
Hub location
,
Vehicle routing
,
Network design
,
Heuristics
URI
https://hdl.handle.net/11511/13712
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
A genetic algorithm for the uncapacitated single allocation planar hub location problem
Damgacioglu, Haluk; DİNLER, DERYA; Özdemirel, Nur Evin; İyigün, Cem (2015-10-01)
Given a set of n interacting points in a network, the hub location problem determines location of the hubs (transfer points) and assigns spokes (origin and destination points) to hubs so as to minimize the total transportation cost. In this study, we deal with the uncapacitated single allocation planar hub location problem (PHLP). In this problem, all flow between pairs of spokes goes through hubs, capacities of hubs are infinite, they can be located anywhere on the plane and are fully connected, and each s...
Hubbing and routing in postal delivery systems
Cetiner, Selim; Sepil, Canan; Süral, Haldun (2010-12-01)
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 co...
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 maximal covering location model in the presence of partial coverage
Karasakal, O; Karasakal, Esra (2004-08-01)
The maximal covering location problem (MCLP) addresses the issue of locating a predefined number of facilities in order to maximize the number of demand points that can be covered. In a classical sense, a demand point is assumed to be covered completely if located within the critical distance of the facility and not covered at all outside of the critical distance. Since the optimal solution to a MCLP is likely sensitive to the choice of the critical distance, determining a critical distance value when the c...
A simulation study of scheduling algorithms for packet switching networks
Babur, Özgür; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2003)
A scheduling algorithm has the primary role in implementing the quality of service guaranteed to each flow by managing buffer space and selecting which packet to send next with a fair share of network. In this thesis, some scheduling algorithms for packet switching networks are studied. For evaluating their delay, jitter and throughput performances, a discrete event simulator has been developed. It has been seen that fair scheduling provides, fair allocation of bandwidth, lower delay for sources using less ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Çetiner, “An iterative hub location and routing problem for postal delivery systems ,” M.S. - Master of Science, Middle East Technical University, 2003.
