Scheduling with latest arrival consolidation in service network design problems

Download

index.pdf

Date

2014

Author

Yiğit, Aybeniz

Metadata

Show full item record

Item Usage Stats

190
views

254
downloads

In this thesis, we consider the service network design problem of a ground transportation based delivery system, in which routes of demands of commodities between any origin-destination pair are determined. A commodity can be sent from its origin to its destination through direct delivery, however such a routing would not effectively make use of the vehicles used for transportation. To benefit from economies of scale, a networking policy based on consolidation is generally applied in service networks. We consider freight-consolidation, in which different commodities are consolidated to be transported using common vehicles and consolidation operations are performed at stations, some of which are chosen as terminals. Nonsimultaneous arrival of commodities necessitates waiting times at stations/terminals. The latest arrival consolidation in service network design problem is then, a minimax model that considers the delays at terminals and focuses on minimization of the arrival time of the last arrived commodity to its destination. For the solution of the model, we present exact and heuristic solution procedures. We develop a tailored Generalized Benders Decomposition algorithm and to address larger size networks, we develop a Large Neighborhood Search based algorithm. We show the effectiveness of the heuristic solution procedure by performing extensive computational experiments. In the constructed service network, each direct ride between stations is assumed to be performed by the same vehicle. Extending this assumption to allow multiple vehicles and using event-activity-network representation, we develop a delay management model for service networks that apply latest arrival consolidation.

Subject Keywords

Delivery of goods., Scheduling., Time management., Industrial engineering., Systems engineering

URI

http://etd.lib.metu.edu.tr/upload/12617604/index.pdf
https://hdl.handle.net/11511/23677

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A genetic algorithm for the location-routing problem with time windows Özgönenç, Hande; Meral, Fatma Sedef; Department of Industrial Engineering (2006) The emphasis on minimizing the logistics costs to decrease overall system costs has led the researchers to consider the interdependencies between the decisions of locating facilities and planning the routes from those facilities. The location-routing problems considering this issue are the subject of this thesis study. A two-level hierarchical distribution system is considered in which goods are delivered from the sources (plants) to the facilities (depots) and then from the facilities to the customers. The...
Multiobjective hub location problem Barutçuoğlu, Aras; Köksalan, Murat; Department of Industrial Engineering (2009) In this study, we propose a two-phase solution approach for approximating the efficient frontier of a bicriteria hub location problem. We develop an evolutionary algorithm to locate the hubs on the network as the first phase. In the second phase, we develop a bounding procedure based on dominance relations and using the determined bounds, we solve the allocation subproblem for each located hub set. The two-phase approach is tested on the Australian Post data set and it is observed that our approach approxim...
Analysis of local sectoral policies via system dynamics approach: the case of Alanya tourism sector Dumbar, Burcu; Sayın, Erol; Department of Industrial Engineering (2009) The purpose of this work is indicating System Dynamics Approach to be an appropriate tool for analysis of policies suggested for local sectors. Local sectors are very important for stability of the country’s economy as well as welfare of the local community. Therefore, feasible and effective policies should be created and implemented in order to contribute to the local sectoral development. But before any policy implementation, policy analysis is required on to evaluate whether effectiveness and feasibility...
The budget constrained discrete time/cost trade-off problem in project networks Değirmenci, Güvenç; Azizoğlu, Meral; Department of Industrial Engineering (2008) The time/cost trade-off models in project management aim to compress the project completion time by accelerating the activity durations at an expense of additional resources. The budget problem in discrete time/cost trade-off scheduling selects the time/cost mode -among the discrete set of specified modes- for each activity so as to minimize the project completion time without exceeding the available budget. There may be alternative modes that solve the budget problem optimally, however each solution may ha...
Cost estimation of trackworks of light rail and metro projects Öztürk, Erhan; Gündüz, Murat; Department of Civil Engineering (2009) The main objective of this work is to develop models using multivariable regression and artificial neural network approaches for cost estimation of the construction costs of trackworks of light rail transit and metro projects at the early stages of the construction process in Turkey. These two approaches were applied to a data set of 16 projects by using seventeen parameters available at the early design phase. According to the results of each method, regression analysis estimated the cost of testing sample...

Citation Formats

A. Yiğit, “Scheduling with latest arrival consolidation in service network design problems,” Ph.D. - Doctoral Program, Middle East Technical University, 2014.