An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model

Dong, Gang; Tang, Jiafu; Lai, Kin Keung; Kong, Yuan

doi:10.1007/s10845-009-0311-9

Cited by 31 publications

(18 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Except software package service as programming solver, MP-based approaches observed in the field of three targeted fields are as follows: Branch-and-Bound [34], Branch-and-Cut [146], Branch-and-Price [219], Branch-and-Cut-and-Price [142], Dynamic Programming [220], Lagrangian Relaxation [221], Column Generation [222], Set Partitioning [223], Constraint Programming [224], Goal Programming [225], Set Covering [226], and so forth. As shown in Table 1, it can be observed that the most frequently used mathematical programming-based method in the field of scheduling is B&B (Branch-and-Bound), while B&P (Branch-and-Price) is the most popular branching method in the field of VRP.…”

Section: Mathematical Programming-based Approachesmentioning

confidence: 99%

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Fei

Shen

2017

Scientific Programming

View full text Add to dashboard Cite

Over the past decades, optimization in operations management has grown ever more popular not only in the academic literature but also in practice. However, the problems have varied a lot, and few literature reviews have provided an overview of the models and algorithms that are applied to the optimization in operations management. In this paper, we first classify crucial optimization areas of operations management from the process point of view and then analyze the current status and trends of the studies in those areas. The purpose of this study is to give an overview of optimization modelling and resolution approaches, which are applied to operations management.

show abstract

Section: Mathematical Programming-based Approachesmentioning

confidence: 99%

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Fei

Shen

2017

Scientific Programming

View full text Add to dashboard Cite

show abstract

“…According to Eq. (1), the time window of customer point w can be calculated as e s w 6 t w 6 l s w (Dong et al, 2011). These distinctive characteristics mean that the number of the all feasible trips of PDCA is small, and so we can use setpartitioning formulation to obtain the optimal solution.…”

Section: Problem Description Of Pdcamentioning

confidence: 99%

“…For one company, Dong et al (2011) proposed the method to obtain all feasible trips and the distance of each trip. Referring to the method, we develop the algorithm to obtain all feasible trips and the carbon emission of each trip for more companies in non-integrated scheduling.…”

Section: Notations Of Non-integrated Scheduling Pdcamentioning

confidence: 99%

Reducing carbon emission of pickup and delivery using integrated scheduling

Tang

et al. 2016

Transportation Research Part D: Transport and Environment

Self Cite

View full text Add to dashboard Cite

“…Constraint (12) ensures that each product in the second stage starts being transported only after the completion of any precedent subset product in . Constraint (13) and (14) indicate direct shipment mode. A truck only carries a kind of products and there must be a sequence between two products.…”

Section: Parametersmentioning

confidence: 99%

Hybrid Particle Swarm Optimization for Two-stage Cross Docking Scheduling

Zhao¹,

Chen²

2015

IJHIT

View full text Add to dashboard Cite

In order to improve supply chain's operation efficiency, shorten delivery time and decrease distribution costs, two-stage cross docking scheduling problem under direct shipment mode was studied in this paper. Taking into consideration the influence of numbers of vehicles in distribution center on cross docking problem, three models were established based on different assumptions including only one vehicle in distribution center, many vehicles in distribution center and the location of distribution center to be determined, and the objective was to minimize transportation time. Hybrid particle swarm optimization was proposed to solve the model on the basis of PSO and GA. The algorithm introduced clone selection operator to make particles multiply and mutate by calculating the affinity between individuals so that the best individual can be reserved and the poor can be improved. Clone operator, crossover operator, antibody reorganization operator and mutation operator were designed to improve the performance of the algorithm. Computational experiments showed that the hybrid particle swarm optimization algorithm has faster convergence speed and better solution precision compared with other algorithms. The result of the present work implied that the model in this paper was accord with the reality, and it was effective and feasible.

show abstract

An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model

Cited by 31 publications

References 30 publications

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Reducing carbon emission of pickup and delivery using integrated scheduling

Hybrid Particle Swarm Optimization for Two-stage Cross Docking Scheduling

Contact Info

Product

Resources

About