Hubbing and routing in postal delivery systems

Çetiner, Selim; Sepil, Canan; Süral, Haldun

doi:10.1007/s10479-010-0705-2

Cited by 91 publications

(44 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Given a fractional solution ðx n ; z n1 ; z n2 ; g n Þ, the separation routines for constraints (14)- (16), (20), (8), and (18) are applied, in this sequence. The violation of constraints (17) is checked only if no other violated cuts have been found.…”

Section: Cutting Plane Phasementioning

confidence: 99%

“…Inequalities (18) are similar to the rounded capacity inequalities for the capacitated vehicle routing problem [35]. We propose to separate them heuristically as follows.…”

Section: Separation Of Inequalities (18)mentioning

confidence: 99%

“…HLRP arises in transportation and logistics applications where hubbing is used and nodes do not have sufficient demand to justify direct connections with the hubs (see, e.g. [8,11,18,36,44] for similar situations). In particular, this situation often appears in postal delivery and cargo delivery applications, where many small branch offices are located in population centers and vehicles collect their traffic and carry them to a hub.…”

Section: Introductionmentioning

confidence: 99%

“…The authors present a model and propose a nested solution methodology. Çetiner et al [18] study a multiple allocation hub location and routing problem for the Turkish postal services. They assume that the demand nodes allocated to a hub are served by uncapacitated vehicles that start and end their trips at the hub node.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A branch-and-cut algorithm for the hub location and routing problem

Rodríguez-Martín

Salazar-González

Yaman

2014

Computers & Operations Research

View full text Add to dashboard Cite

We study the hub location and routing problem where we decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total transportation cost. Each hub has one vehicle that visits all the nodes assigned to it on a cycle. We propose a mixed integer programming formulation for this problem and strengthen it with valid inequalities. We devise separation routines for these inequalities and develop a branch-and-cut algorithm which is tested on CAB and AP instances from the literature. The results show that the formulation is strong and the branch-and-cut algorithm is able to solve instances with up to 50 nodes. © 2014 Elsevier Ltd

show abstract

Section: Cutting Plane Phasementioning

confidence: 99%

“…Inequalities (18) are similar to the rounded capacity inequalities for the capacitated vehicle routing problem [35]. We propose to separate them heuristically as follows.…”

Section: Separation Of Inequalities (18)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A branch-and-cut algorithm for the hub location and routing problem

Rodríguez-Martín

Salazar-González

Yaman

2014

Computers & Operations Research

View full text Add to dashboard Cite

show abstract

“…In terms of postal sector, there is evident lack of papers, generally speaking. We find papers relating to universal postal service, some of them are: (Calzada, 2009;Mirabel et al, 2009;Cetiner et al, 2010) and one paper which treated question of employees' stress level, as well as quality improvement in Serbian Post (Dobrodolac et al, 2012). According to the authors knowledge there are no papers concerning the implementation of ABC and ABC/M within the postal sector.…”

Section: Literature Reviewmentioning

confidence: 99%

The Modified Activity-Based Costing Method in Universal Postal Service Area: Case Study of the Montenegro Post

Kujacic

Blagojevic

Šarac

et al. 2015

View full text Add to dashboard Cite

The 3rd EC Postal Directive proposes a calculation approach to separately determine the net cost of universal service obligation. Also proposes presence of liability to compensate the universal service provider. In this paper, authors have presented the necessity of compliance with Postal Directives through application of the activity-based costing method for costs calculation related to the universal postal operator. The objective of this paper is to research the possibility of modification of the existing, traditional ABC method. Method will improve the quality of cost accounting of the universal postal operators. The aim is to present the implementation of the modified activity-based cost accounting method from the point of view of a universal postal service. Conceptual framework for the modified activity-based costing in the area of universal postal service has been developed and applied in the Montenegro Post. This modification of the traditional activity-based costing, called the modified activity-based costing, for solving specific accounting problems in a universal postal service area, is the main contribution of the paper. As long as the modified ABC method is not created and implemented, the Montenegro Post has been unable to adequately respond to the established legal requirements. The presented method can be a guide for other postal companies with matters concerning the calculation of costs and revenues.

show abstract

Heuristics for a hub location‐routing problem

Lopes

Andrade²,

Queiroz

et al. 2016

Networks

View full text Add to dashboard Cite

We investigate a variant of the many‐to‐many hub location‐routing problem which consists in partitioning the set of nodes of a graph into routes containing exactly one hub each, and determining an extra route interconnecting all hubs. A variable neighborhood descent with neighborhood structures based on remove/add, swap and exchange moves nested with routing and location operations is used as a local search procedure in a multistart algorithm. We also consider a sequential version of this local search in the multistart. In addition, a biased random‐key genetic algorithm working with a local search routine, which also considers routing and location operations, is applied to the problem. To compare the heuristic solutions, we develop an integer programming formulation which is solved with a branch‐and‐cut algorithm. Capacity and path elimination constraints are added in a cutting plane fashion. The separation algorithms are based on the computation of min‐cut trees and on the connected components of a support graph. Computational experiments were conducted on several benchmark instances of routing problems and show that the heuristics are effective on medium to large‐sized instances, while the branch‐and‐cut algorithm solves small to medium sized problems to optimality. These algorithms were also compared with a commercial hybrid solver showing that the heuristics are quite competitive. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(1), 54–90 2016

show abstract

Hubbing and routing in postal delivery systems

Cited by 91 publications

References 36 publications

A branch-and-cut algorithm for the hub location and routing problem

A branch-and-cut algorithm for the hub location and routing problem

The Modified Activity-Based Costing Method in Universal Postal Service Area: Case Study of the Montenegro Post

Heuristics for a hub location‐routing problem

Contact Info

Product

Resources

About