A Branch-and-Price Approach for a Ship Routing Problem ... - gerad

ePAPER READ

DOWNLOAD ePAPER

gerad.ca

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

START NOW

Compartment Sub problem

• Node: harbor arrival plus quantity per grade

• Reduced cost per arc:

– Fixed

– Time dependent

Stabilized Dynamic Constraint Aggregation (SDCA) for ... - gerad

On some properties of DNA graphs - gerad

The Metric Cutpoint Partition Problem - gerad

Variable Space Search for Graph Coloring - gerad

Notes du cours MTH1101 â Calcul I Partie III: Optimisation - gerad

An introduction to GENCOL - Centre de recherche sur les transports

Directed weighted improper coloring for cellular channel ... - gerad

Disjunctive cuts in branch-and-but-and-price algorithms ... - gerad

Applications #2 ProblÃ¨me du voyageur de commerce (TSP) - gerad

Optimizing Location, Routing and Scheduling Decisions ... - gerad

2. Variables aléatoires unidimensionnelles - gerad

Compartment Sub problem • Node: harbor arrival plus quantity per grade • Reduced cost per arc: – Fixed – Time dependent 16

Compartment Sub problem s • Shortest path from s to any other node (taking into account time aspect) • Can be solved with Dynamic Programming (Christiansen, 1998/9) 17

Page 1 and 2: A Branch-and-Price Approach for a S
Page 3 and 4: Practical Application Oil Company
Page 5 and 6: Practical Application • There is
Page 7 and 8: Inventory levels Upper Alarm Zone P
Page 9 and 10: Notation (Christiansen, 1998) • (
Page 11 and 12: Mathematical Formulation (1) min
Page 13 and 14: Mathematical Formulation (3) ∑∑
Page 15: Branch-and-Price Framework Add init
Page 19 and 20: Implementation Issues • Pricing p
Page 21: Questions? 21

A Branch-and-Price Approach for a Ship Routing Problem ... - gerad

Create successful ePaper yourself

Delete template?

Save as template?