On the mathematical modeling of green one-to-one pickup and delivery problem with road segmentation

Soysal, Mehmet; Çi̇men, Mustafa; Demir, Emrah

doi:10.1016/j.jclepro.2017.11.040

Cited by 43 publications

(22 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fleischmann et al [21], Cornuéjols et al [22], Aragão et al [23], Letchford et al [24], Li et al [25], Mahmoudi et al [26]). The classical OPDP can be easily formulated as a Mixed-Integer Program (MIP), such as those reported in Pérez et al [17], Sahin et al [18] and Soysal et al [19]. In a forthcoming article, we studied a new kind of OPDP, named One-to-one Pickup and Delivery Problems with Shortest-path Transport (OPDPST), in which each pd-pair must be transported along the shortest path, and a new kind of modeling method was proposed for the OPDPST according its new route constructions.…”

Section: Opdp Opdpst and Opdpstrpmentioning

confidence: 99%

“…There are also some exact methods proposed for the OPDP, Pérez et al [17] solve two mixed integer linear programming models of the OPDPTSP by the Cplex solver. Soysal et al [19] proposed a mixed integer programming model for the green OPDP, and solved it by the Cplex solver.…”

Section: Neighborhood and Algorithm For Opdpmentioning

confidence: 99%

“…Recently, research into the OPDP (e.g. Pérez et al [17], Sahin et al [18] and Soysal et al [19]) outnumbered studies into the MMPDP (e.g., Rieck et al [4]) and OMOPDP (e.g., Zhu et al [20]).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths

Zhuo

Xiong

et al. 2020

PLoS ONE

View full text Add to dashboard Cite

The One-to-one Pickup and Delivery Problem with Shortest-path Transport along Real-life Paths (OPDPSTRP) is presented in this opaper. It is a variation of the One-to-one Pickup and Delivery Problem (OPDP), which is common in daily life, such as the Passenger Train Operation Plans (PTOP) and partial Taxi-sharing Problem. Unlike the classical OPDP, in the OPDPSTRP, (1) each demand must be transported along the shortest path according to passengers/shippers requirements, and (2) each vehicle should travel along a real-life path. First, six route structure rules are proposed for the OPDPSTRP, and a kind of Mixed-Integer Programming (MIP) models is formulated for it. Second, A Variable Neighborhood Descent (VND), a Variable Neighborhood Research (VNS), a Multi-Start VND (MS_VND) and a Multi-Start VNS (MS_VNS) with five neighborhood operators has been developed to solve the problem. Finally, The Gurobi solver, the VND, the VNS, the MS_VND and the MS_VNS have been compared with each other by 84 random instances partitioned in small size connected graphs, medium size connected graphs and large size connected graphs. From the test results we found that solutions generated by these approaches are often comparable with those found by the Gurobi solver, and the solutions found by these approaches are better than the solutions found by the Gurobi solver when solving instances with larger numbers of demands. In almost all instances, the MS_VND significantly outperforms the VND and the VNS in terms of solution quality, and outperforms the MS_VNS both in terms of solution quality and CPU time. In the instances with large numbers of demands, the MS_VND is still able to generate good feasible solutions in a reasonable CPU time, which is of vital practical significance for real-life instances. OPEN ACCESSCitation: Qi X, Fu Z, Xiong J, Zha W (2020) Multistart heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths. PLoS ONE 15(2): e0227702.

show abstract

Section: Opdp Opdpst and Opdpstrpmentioning

confidence: 99%

Section: Neighborhood and Algorithm For Opdpmentioning

confidence: 99%

See 1 more Smart Citation

Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths

Zhuo

Xiong

et al. 2020

PLoS ONE

View full text Add to dashboard Cite

show abstract

“…A linearization technique was adopted, and a constructive heuristic approach was proposed to solve the problem efficiently. Soysal et al [10] improved the traditional models for the one-to-one pickup and delivery problem with the consideration of sustainable logistics. Factors, including fuel consumption, variable vehicle speed, and road categorization were considered, and a mixed integer programming model was constructed.…”

Section: Literature Reviewmentioning

confidence: 99%

An Integrated Approach for Sustainable Supply Chain Management with Replenishment, Transportation, and Production Decisions

Lee

Kang

et al. 2018

Sustainability

View full text Add to dashboard Cite

Sustainable supply chain management is important for most firms in today’s competitive environment. This study considers a supply chain environment under which the firm needs to make decisions regarding from which supplier and what quantity of parts should be purchased, which vehicle with a certain emissions amount and transportation capacity should be assigned, and what kind of production mode should be used. The integrated replenishment, transportation, and production problem is concerned with coordinating replenishment, transportation, and production operations to meet customer demand with the objective of minimizing the cost. The problem considered in this study involves heterogeneous vehicles with different emission costs, various materials with dissimilar emission costs, and distinct production modes, each with their own emission costs. In addition, multiple suppliers with different quantity discount schemes are considered, different kinds of vehicles with different loading capacities and traveling distance limits are present, and different production modes with different production capacities and production costs are included. A mixed integer programming model is proposed first to minimize the total cost, which includes the ordering cost, purchase cost, transportation cost, emission cost, production cost, inventory-holding cost, and backlogging cost, while satisfying various constraints in replenishment, transportation, and production. A particle swarm optimization model is constructed next to deal with large-scale problems that are too complicated to solve by the mixed integer programming. The main advantage of the proposed models lies in their ability to simultaneously coordinate the replenishment, transportation, and production operations in a planning horizon. The proposed particle swarm optimization model could further identify a near-optimal solution to the complex problem in a very short computational time. To the best of the authors’ knowledge, this is the first paper that considers the sustainable supply chain management problem with multiple suppliers, multiple vehicles, and multiple production modes simultaneously. Case studies are presented to examine the practicality of the mixed integer programming and the particle swarm optimization models. The proposed models can be adopted by the management to make relevant supply chain management decisions.

show abstract

“…The VRP problem is different from traditional routing problems such as Traveling Salesman Problem (TSP), it can be more complicated by taking consideration of multiple vehicles and various constraints. The classical VRP problem can be summarized as follows [3]-there is a certain number of customers with different cargo needs. Distribution centers provide cargo to customers.…”

Section: Introductionmentioning

confidence: 99%

SVND Enhanced Metaheuristic for Plug-In Hybrid Electric Vehicle Routing Problem

Li¹,

Shi²,

Zhao³

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

Plug-in Hybrid Electric Vehicles (PHEVs), as a new type of environmental-friendly low cost transportation, have attracted growing interests for logistics. The path-planning optimization for PHEV has become a major challenge. In fact, PHEV-based routing optimization is a type of hybrid vehicle routing problem (HVRP). Compared with the traditional Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP), the PHEV routing problem should consider more constraints, such as time limits, capacity constraints (including fuel tank capacity and battery capacity), electric stations, fuel stations and so forth. In this paper, a Mixed Integer Linear Programming formulation is presented and a novel hybrid metaheuristic approach (HMA_SVND) is proposed. Our method is a combination of memetic algorithm (MA), sequential variable neighborhood descent (SVND) and a revised 2_opt method. Comparative studies show that our proposed method outperformed previous works.

show abstract

On the mathematical modeling of green one-to-one pickup and delivery problem with road segmentation

Cited by 43 publications

References 50 publications

Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths

Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths

An Integrated Approach for Sustainable Supply Chain Management with Replenishment, Transportation, and Production Decisions

SVND Enhanced Metaheuristic for Plug-In Hybrid Electric Vehicle Routing Problem

Contact Info

Product

Resources

About