10:30 AM - 10:55 AM
Modeling the hyperconnected urban freight transportation system (HCL)
We introduce a new problem for selecting services in a tactical plan of an n-tier hyperconnected city logistics system. Compared to existing models, we consider a coalition of carriers and logisticians sharing their resources and residual transportation capacity. These actors share their equipment and their information in order to optimize economic costs and environmental impact.
10:55 AM - 11:20 AM
Multi-period prize collecting Steiner tree problem with budget constraints
In this work we consider the problem of finding an optimal expansion plan for gas pipeline networks. The model maximizes the potential increase to a company’s profit on a specified horizon. It is defined as a Multi-period Prize Collecting Steiner Tree problem with budget constraints, since there are vertex profits, edge costs and budget limits per period.
11:20 AM - 11:45 AM
Relay network design under demand uncertainty
The placement problem of relays arises in telecommunications and distribution systems where the load must be regenerated or transferred at intermediate stations (relays) on the route from its origin to its destination. The optimal location of relay nodes depends on the traffic pattern on the network; however, this pattern might be uncertain or variable over time. We review various formulations and variations of the problem (mainly deterministic) from the literature. Then we explicitly incorporate demand uncertainty in the strategic design of the relay network and explore alternative formulations. Preliminary results are presented.
11:45 AM - 12:10 PM
Distribution network design and inventory planning under uncertainty
An integrated distribution network design-inventory control problem with service requirements in retailing is addressed. This problem is complex due to the general form of demand uncertainty and nonlinear customer service level constraints. To solve the problem, an algorithm based on branch-and-cut framework and a new family of valid cuts are presented. A heuristic approach is developed to tackle large scale problems.