Service Network Design Problem with Capacity-Demand Balancing

by   Yusuf Secerdin, et al.

This paper addresses developing cost-effective strategies to respond to excessive demand in the service network design problem in a multi-period setting. The common assumption states that the capacity of freight carriers' assets is capable of handling all of the forecasted demand; however, we assume that there are certain periods such as holiday season in which excessive demand is observed. The demand strictly exceeds the carrier's capacity; even though, the average demand can be still fulfilled throughout the year. In this sense, we let the carrier has three options to respond to the demand: Dispersing the demand with a penalty, leasing additional asset(s) temporarily, and outsourcing some capacity. We propose a modeling and solution approach that jointly incorporates asset management and sizing, outsourcing (3PLs), and earliness/tardiness penalties. The objective is to minimize the overall operational costs by optimally selecting and scheduling the home fleet with respect to 'demand shifting' choices, selecting services from third parties, and routing the commodities on the designed network. We propose an arc-based formulation as well as valid inequalities and present a comprehensive computational study on the randomly generated instances. The formulations with valid inequalities (VIs) outperform the regular formulation in obtaining tighter lower bounds. One set of VIs can improve the CPU time elapsed by 25 medium-instances that can be solved optimally within the time limit. Furthermore, we develop a custom multi-phase dedicate-merge-and-mix algorithm (DMaM) to solve CSSND problem with an emphasis of obtaining solutions as high-quality as possible practically in a short time in the real world. DMaM has a promising potential to obtain solutions especially for very large instances whereas the commercial solver cannot initialize the B&B algorithm due to excessive memory usage.


Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection

This paper considers the multi-item inventory lot-sizing problem with su...

New approaches for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure

We consider the uncapacitated three-level lot-sizing and replenishment p...

A Two-step Heuristic for the Periodic Demand Estimation Problem

Freight carriers rely on tactical plans to satisfy demand in a cost-effe...

Hub and Spoke Logistics Network Design for Urban Region with Clustering-Based Approach

This study aims to propose effective modeling and approach for designing...

Multi-episodic Perceived Quality of an Audio-on-Demand Service

QoE is traditionally evaluated by using short stimuli usually representi...

Enhanced Formulation for Guillotine 2D Cutting Problems

We advance the state of the art in Mixed-Integer Linear Programming (MIL...

Location and Capacity Planning of Facilities with General Service-Time Distributions Using Conic Optimization

This paper studies a stochastic congested location problem in the networ...

Please sign up or login with your details

Forgot password? Click here to reset