Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

A period vehicle routing problem with time windows and backhauls

Chang, Chia-Sheng

Abstract Details

1993, Doctor of Philosophy, Case Western Reserve University, Operations Research.
This dissertation develops solution procedures for the Period Vehicle Routing Problem with Time-windows and Backhauls (PVRPTWB). The problem includes many real-world considerations, such as time-window constraints, driver waiting cost, backhauls, layovers, and others, simultaneously. A mathematical formulation for the PVRPTWB is given. An exact algorithm based on a set-partitioning formulation is presented. The algorithm combines column generation with a branch-and-bound approach. The columns are generated by solving a shortest-path problem with additional side constraints. Heuristic algorithms are also given. Extensive computational test have been performed. Results on a real-world case study are also included. These results indicate that this approach is particularly efficient when the time-window constraints are relatively tight.
Daniel Solow (Advisor)
151 p.

Recommended Citations

Citations

  • Chang, C.-S. (1993). A period vehicle routing problem with time windows and backhauls [Doctoral dissertation, Case Western Reserve University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=case1057156056

    APA Style (7th edition)

  • Chang, Chia-Sheng. A period vehicle routing problem with time windows and backhauls. 1993. Case Western Reserve University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=case1057156056.

    MLA Style (8th edition)

  • Chang, Chia-Sheng. "A period vehicle routing problem with time windows and backhauls." Doctoral dissertation, Case Western Reserve University, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=case1057156056

    Chicago Manual of Style (17th edition)