Optimizing Location, Routing and Scheduling Decisions ... - gerad
Optimizing Location, Routing and Scheduling Decisions ... - gerad
Optimizing Location, Routing and Scheduling Decisions ... - gerad
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Pairing Concept<br />
Introduction<br />
Problem Definition <strong>and</strong> Formulation<br />
Solution Methodology<br />
Conclusion<br />
References<br />
Problem Definition<br />
Set Partitioning Formulation<br />
Pairing:<br />
A set of routes that can be served sequentially by one vehicle within the<br />
vehicle’s working hour limit.<br />
PAIRING<br />
FACILITY<br />
CUSTOMER<br />
A pairing is feasible if<br />
each customer included in the pairing<br />
is visited once,<br />
each route included starts <strong>and</strong> ends<br />
at the same facility,<br />
total dem<strong>and</strong> of each route ≤ vehicle<br />
capacity,<br />
total travel time of the pairing ≤<br />
vehicle working hour limit<br />
PAIRING<br />
Akça, Ralphs, Berger<br />
LRS PROBLEM
Change language