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

@article{Dong2011AnEA,
  title={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},
  author={Gang Dong and Jiafu Tang and Kin Keung Lai and Yuan Kong},
  journal={Journal of Intelligent Manufacturing},
  year={2011},
  volume={22},
  pages={789-799}
}
This paper addresses a vehicle routing and scheduling problem arising in Flight Ticket Sales Companies for the service of free pickup and delivery of airline passengers to the airport. The problem is formulated under the framework of Vehicle Routing Problem with Time Windows (VRPTW), with the objective of minimizing the total operational costs, i.e. fixed start-up costs and variable traveling costs. A 0–1 mixed integer programming model is presented, in which service quality is factored in… CONTINUE READING
1
Twitter Mention

Similar Papers

Figures, Tables, Results, and Topics from this paper.

Key Quantitative Results

  • Computational results obtained by applying the proposed algorithm, showing the cost of achieving passenger satisfaction degrees varying from 10% to 100%, are presented in Tables 2, 3, 4, and 5.
  • Our computational results show that all the passenger satisfaction degrees can be guaranteed at the level of at least 90% when ANP reaches 3.2 or ACP reaches 10.

Citations

Publications citing this paper.
SHOWING 1-10 OF 15 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 31 REFERENCES

Local search with annealing-like restarts to solve the VRPTW

  • European Journal of Operational Research
  • 2003
VIEW 1 EXCERPT