This study develops a model for customer selection and vehicle scheduling with time windows for moving companies. To reflect the actual operations of moving companies, the proposed model employs two major processes to extend the traditional vehicle routing models. First, loading and unloading activities of moving vehicles are explicitly modeled using the technique of time–space networks. Second, moving companies are flexible in selecting customers, thereby possibly maximizing the profit of companies. The model is formulated as an integer multi-commodity network with side constraints. A decomposition-based solution algorithm is developed to solve the problem efficiently. Results of a case study indicate that the proposed methodology efficiently generates reasonable plans of customer selection and vehicle scheduling. Sensitivity analysis shows that the proposed model properly responds to the change in critical parameters. Therefore, the proposed methodology has a strong potential to improve the operations and profitability of moving companies.
- Moving company
- multi-commodity network flow model
- solution algorithm
- time–space network