Bounding procedures on bi-directional labeling algorithm of tdvrptw in branch-and-cut-and-price framework

Download

index.pdf

Date

2011

Author

Kökten, Selen

Metadata

Show full item record

Item Usage Stats

60
views

41
downloads

In this thesis we consider a Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW) which is solved by a Branch and Cut and Price (BCP) algorithm. The decomposition of an arc based formulation leads to a set-partitioning problem as the master problem, and a Time-Dependent Elementary Shortest Path Problem with Resource Constraints (TDESPPRC) as the pricing problem. The main contribution of this thesis is the modified fathoming and bounding procedures applied on bi-directional Time-Dependent Labeling algorithm (TDL) which is used solve the TDESPPRC. The aim of the fathoming proposed is to solve TDVRPTW more efficiently by not extending the unproductive labels in bi-directional TDL algorithm. Moreover, an arc bounding model is introduced to stop the extension of labels as an alternative to resource bounding used in bi-directional search. In addition, independent from the work on TDVRPTW, the thesis includes an effects analysis of a new customer on Kuehne+Nagel(K+N) Netherlands Fast Moving Consumer Goods (FMCG) and returns distribution network. This study focused on analyzing the current performance of the distribution network and evaluating the scenarios for K+N’s future distribution network by a simulation study.

Subject Keywords

Logistics., Operations research.

URI

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

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Low-frequency multilevel fast multipole algorithm using an approximate diagonalization of the Green's function Ergül, Özgür Salih (2014-08-23) We present an approximate diagonalization of the Green's function to implement a stable multilevel fast multipole algorithm (MLFMA) for low-frequency problems. The diagonalization is based on scaled spherical functions, leading to stable computations of translation operators at all distances and for all frequencies. Similar to the conventional diagonalization, shift operators are expressed in terms of complex exponentials, while radiated and incoming fields are expanded in terms of scaled plane waves. Even ...
Part selection problem in disassembly systems Yetere, Ayça; Kandiller, Levent; Department of Industrial Engineering (2006) In this study, we consider the disassembly problem of end-of-life (EOL) products for recovering valuable parts or assemblies. All parts obtained by disassembly processes of an EOL product may not be profitable due to their high recovery costs. Our problem is to select the parts to be released and determine the associated disassembly tasks so as to maximize the total profit. We first tackle the simple part selection problem, and then introduce a time constraint for the tasks to be performed for selected part...
Stabilization of the Fast Multipole Method for Low Frequencies Using Multiple-Precision Arithmetic Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2014-08-23) We stabilize a conventional implementation of the fast multipole method (FMM) for low frequencies using multiple-precision arithmetic (MPA). We show that using MPA is a direct remedy for low-frequency breakdowns of the standard diagonalization, which is prone to numerical errors at short distances with respect to wavelength. By increasing the precision, rounding errors are suppressed until a desired level of accuracy is obtained with plane-wave expansions. As opposed to other approaches in the literature, u...
Fusion of Image Segmentations under Markov Random Fields Karadag, Ozge Oztimur; Yarman Vural, Fatoş Tunay (2014-08-28) In this study, a fast and efficient consensus segmentation method is proposed which fuses a set of baseline segmentation maps under an unsupervised Markov Random Fields (MRF) framework. The degree of consensus among the segmentation maps are estimated as the relative frequency of co-occurrences among the adjacent segments. Then, these relative frequencies are used to construct the energy function of an unsupervised MRF model. It is well-known that MRF framework is commonly used for formulating the spatial r...
Preconditioning iterative MLFMA solutions of integral equations Gürel, Levent; Malas, Tahir; Ergül, Özgür Salih (2010-08-19) The multilevel fast multipole algorithm (MLFMA) is a powerful method that enables iterative solutions of electromagnetics problems with low complexity. Iterative solvers, however, are not robust for three-dimensional complex reallife problems unless suitable preconditioners are used. In this paper, we present our efforts to devise effective preconditioners for MLFMA solutions of difficult electromagnetics problems involving both conductors and dielectrics.

Citation Formats

S. Kökten, “Bounding procedures on bi-directional labeling algorithm of tdvrptw in branch-and-cut-and-price framework,” M.S. - Master of Science, Middle East Technical University, 2011.