Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
The campaign routing problem
Download
index.pdf
Date
2009
Author
Özdemir, Emrah
Metadata
Show full item record
Item Usage Stats
100
views
26
downloads
Cite This
In this study, a new selective and time-window routing problem is defined for the first time in the literature, which is called the campaign routing problem (CRP). The two special cases of the CRP correspond to the two real-life problems, namely political campaign routing problem (PCRP) and the experiments on wheels routing problem (EWRP). The PCRP is based on two main decision levels. In the first level, a set of campaign regions is selected according to a given criteria subject to the special time-window constraints. In the second level, a pair of selected regions or a single region is assigned to a campaign day. In the EWRP, a single selected region (school) is assigned to a campaign day. These two problems are modeled using classical mathematical programming and bi-level programming methods, and a two-step heuristic approach is developed for the solution of the problems. Implementation of the solution methods is done using the test instances that are compiled from the real-life data. Computational results show that the solution methods developed generate good solutions in reasonable time.
Subject Keywords
Industrial engineering.
,
Engineering instruments.
URI
http://etd.lib.metu.edu.tr/upload/12610955/index.pdf
https://hdl.handle.net/11511/19035
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
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...
The inventory routing problem with deterministic order-up-to level inventory policies
Pınar, Özlem; Süral, Haldun; Department of Industrial Engineering (2005)
This study is concerned with the inventory routing problem with deterministic, dynamic demand and order-up-to level inventory policy. The problem mainly arises in the supply chain management context. It incorporates simultaneous decision making on inventory management and vehicle routing with the purpose of gaining advantage from coordinated decisions. An integrated mathematical model that represents the features of the problem is presented. Due to the magnitude of the model, lagrangean relaxation solution ...
Mixed-model two-sided assembly line balancing
Uçar, Emre; Kırca, Ömer; Department of Industrial Engineering (2010)
In this study we focus on two-sided mixed-model assembly line balancing type-I problem. There is a production target for a fixed time horizon and the objective is to produce this amount with the minimum level of workforce. A mathematical model is developed to solve this problem in an optimal manner. For large scale problems, the mathematical model fails to give the optimal solution within reasonable computational times. Thus, a heuristic approach based on threshold accepting algorithm is presented. Both the...
The multiple retailer inventory routing problem with backorders
Alişan, Onur; Süral, Haldun; Department of Industrial Engineering (2008)
In this study we consider an inventory routing problem in which a supplier distributes a single product to multiple retailers in a finite planning horizon. Retailers should satisfy the deterministic and dynamic demands of end customers in the planning horizon, but the retailers can backorder the demands of end customers considering the supply chain costs. In each period the supplier decides the retailers to be visited, and the amount of products to be supplied to each retailer by a fleet of vehicles. The de...
A comparison of some robust regression techniques
Avcı, Ezgi; Köksal, Gülser; Department of Industrial Engineering (2009)
Robust regression is a commonly required approach in industrial studies like data mining, quality control and improvement, and finance areas. Among the robust regression methods; Least Median Squares, Least Trimmed Squares, Mregression, MM-method, Least Absolute Deviations, Locally Weighted Scatter Plot Smoothing and Multivariate Adaptive Regression Splines are compared under contaminated normal distributions with each other and Ordinary Least Squares with respect to the multiple outlier detection performan...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Özdemir, “The campaign routing problem,” M.S. - Master of Science, Middle East Technical University, 2009.