THESIS DEFENSE :: Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargo and Rail Blocks

Event Details
  • Date/Time:
    • Friday November 10, 2006 - Thursday November 9, 2006
      2:00 pm - 11:00 pm
  • Location: Room 403 Groseclose Building
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
Barbara Christopher
Industrial and Systems Engineering
Contact Barbara Christopher
404.385.3102
Summaries

Summary Sentence: THESIS DEFENSE :: Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargo and Rail Blocks

Full Summary: THESIS DEFENSE :: Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargo and Rail Blocks

This thesis introduces a new model formulation to solve routing and scheduling problems, with the main applications in answering routing and scheduling problems faced by a sea-cargo shipping company and a railroad company.

For the work in sea-cargo routing and scheduling, we focus our methodology on the tramp shipping operation. Tramp shipping is a demand-driven type of shipping operation which does not have fixed schedules. The schedules are based on the pickup and download locations of profitable service requests. The problem is that given a set of products distributed among a set of ports, with each product having pickup and download time windows and a destination port, find the schedule for a fleet of ships that maximizes profit for a specified time horizon. The problem is modeled as a Mixed Integer Non-Linear Program and reformulated as a Mixed Integer Linear Program. Three heuristic methods, along with computational results, are presented. We also exploit the special structure enjoyed by our model and introduce an upper-bounding problem to the model. With a little modification, the model is readily extendable to reflect soft time windows and inter-ship cargo-transfers.

The other part of our work is the work in train routing and scheduling. A typical train shipment consists of a set of cars having the common origin and destination. To reduce the handling of individual shipments as they travel, shipments are grouped into blocks. The problem is that given a set of blocks to be carried from origins to destinations, construct the most cost effective train routes and schedules and determine block-to-train assignments, such that the number of block transfers (block swaps) between trains, the number of trains used, and some other cost measures are minimized. The same modeling technique, with extra precedence requirements, is used. Computational results are presented.

Additional Information

In Campus Calendar
No
Groups

H. Milton Stewart School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Barbara Christopher
  • Workflow Status: Published
  • Created On: Oct 8, 2010 - 7:32am
  • Last Updated: Oct 7, 2016 - 9:52pm