A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery

Karaoğlan, İsmail; Altıparmak, Fulya; Kara, İmdat; Dengız, Berna

doi:10.1016/j.ejor.2011.01.003

Cited by 81 publications

(61 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Because of the stochastic nature of the hGA, it is run 10 times for each instance with different random seeds. Meantime, it is worthy to node that B&C algorithm in Karaoglan et al 2011 for the LRPSPD had been also run at the same computer and its computation time had been limited with four hours for each LRPSPD instance.…”

Section: Computational Resultsmentioning

confidence: 99%

“…To formulate the LRPSPD, following decision variables are used: The two-index flow-based formulation of the LRP SPD is given as follows (Karaoglan et al, 2009(Karaoglan et al, , 2011:…”

Section: Problem Definition and Mathematical Modelmentioning

confidence: 99%

“…Moreover, we have developed branch and cut (B&C) algorithm, which is an exact solution procedure, based on flow-based formulation. Our experimental studies have revealed that our B&C algorithm solves small and some mediumsize LRPSPD instances to optimality within four hours of computation time (Karaoglan et al, 2011).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Hybrid Genetic Algorithm for the Location-Routing Problem with Simultaneous Pickup and Delivery

Karaoğlan¹,

Altıparmak²

2011

Industrial Engineering and Management Systems

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we consider the Location-Routing Problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. Since the LRPSPD is an NP-hard problem, we propose a hybrid heuristic approach based on genetic algorithms (GA) and simulated annealing (SA) to solve the problem. To evaluate the performance of the proposed approach, we conduct an experimental study and compare its results with those obtained by a branch-and-cut algorithm on a set of instances derived from the literature. Computational results indicate that the proposed hybrid algorithm is able to find optimal or very good quality solutions in a reasonable computation time.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

“…To formulate the LRPSPD, following decision variables are used: The two-index flow-based formulation of the LRP SPD is given as follows (Karaoglan et al, 2009(Karaoglan et al, , 2011:…”

Section: Problem Definition and Mathematical Modelmentioning

confidence: 99%

See 1 more Smart Citation

A Hybrid Genetic Algorithm for the Location-Routing Problem with Simultaneous Pickup and Delivery

Karaoğlan¹,

Altıparmak²

2011

Industrial Engineering and Management Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Lin et al (2002), Yu et al (2010), Stenger et al (2012). Greedy randomised adaptive search optimisation Prins et al (2006), Duhamel et al (2010), Nguyen et al (2012) Variable neighbourhood search optimisation Melechovský et al (2005), Ghodsi and Amiri (2010), Derbel et al (2011) Genetic algorithms Zhou and Liu (2007), , Jin et al (2010), Karaoglan and Altiparmak (2010) Branch and cut optimisation Belenguer et al (2011), Karaoglan et al (2011) Mixed-integer programming; Integer linear programming Alumur and Kara (2007), Diabat and Simchi-Levi (2009);Laporte et al (1989); Ambrosino and Scutella (2005) …”

Section: Distribution Systems and The Food Supply Chainmentioning

confidence: 99%

A case analysis of a sustainable food supply chain distribution system—A multi-objective approach

Validi

Bhattacharya

Byrne

2014

International Journal of Production Economics

240

111

View full text Add to dashboard Cite

Abstract:Sustainable supply chain management is a topical area which is continuing to grow and evolve. Within supply chains, downstream distribution from producers to customers plays a significant role in the environmental performance of production supply chains. With consumer consciousness growing in the area of sustainable food supply, food distribution needs to embrace and adapt to improve its environmental performance, while still remaining economically competitive. With a particular focus on the dairy industry, a robust solution approach is presented for the design of a capacitated distribution network for a two-layer supply chain involved in the distribution of milk in Ireland. In particular the green multiobjective optimisation model minimises CO2 emissions from transportation and total costs in the distribution chain. These distribution channels are analysed to ensure the non-dominated solutions are distributed along the Pareto fronts. A multi-attribute decision-making approach, TOPSIS, has been used to rank the realistic feasible transportation routes resulting from the trade-offs between total costs and CO 2 emissions. The refined realistic solution space allows the decision-makers to geographically locate the sustainable transportation routes. In addition to geographical mapping the decision maker is also presented with a number of alternative analysed scenarios which forcibly open closed distribution routes to build resiliency into the solution approach. In terms of model performance, three separate GA based optimisers have been evaluated and reported upon. In the case presented NSGA-II was found to outperform its counterparts of MOGA-II and HYBRID.

show abstract

“…There is a lot of research about the LRP in general logistics systems [3][4][5][6]. But research about LRP in emergency logistics system is not enough.…”

Section: Introductionmentioning

confidence: 99%

Research on Fuzzy Dynamic Location-Routing Problem of Victim Search in Flood Disaster

Li¹,

Zhou²,

Li³

2016

IJUNESST

View full text Add to dashboard Cite

show abstract

A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery

Cited by 81 publications

References 39 publications

A Hybrid Genetic Algorithm for the Location-Routing Problem with Simultaneous Pickup and Delivery

A Hybrid Genetic Algorithm for the Location-Routing Problem with Simultaneous Pickup and Delivery

A case analysis of a sustainable food supply chain distribution system—A multi-objective approach

Research on Fuzzy Dynamic Location-Routing Problem of Victim Search in Flood Disaster

Contact Info

Product

Resources

About