On the balanced k-chinese postmen problems

Limon, Yasemin
In this thesis, we consider a k-Chinese Postmen Problem with the objective of minimizing total squared workloads. Our aim is to balance the workloads of the postmen, while maintaining low total workload. We develop an efficient subtour elimination constraint and incorporate it to our integer program. We develop exact and approximate solution procedures that run in exponential and polynomial time respectively. The results of our computational experiment reveal the satisfactory behaviors of our algorithms in terms of solution speed and solution quality.


Heuristic and exact approaches for multi-objective routing
Tezcaner Öztürk, Diclehan; Köksalan, Murat; Department of Industrial Engineering (2013)
In this thesis, we consider the bi-objective routing problem. This problem is a combination of the bi-objective shortest path problem (finding the efficient arcs between nodes) and the bi-objective traveling salesperson problem (finding the efficient tours composed of efficient arcs). We develop solution procedures to find efficient tours. We consider two different terrain structures; discretized terrain and continuous terrain. In the discretized terrain, the terrain is approximated with grids and we allow ...
In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint. We assume that jobs have arbitrary processing times and resource requirements and there is a unit supply of the resource at each time period. We develop an approximation algorithm for this problem and empirically test its effectiveness in finding the minimum makespan schedules.
Multisymplectic Schemes for the Complex Modified Korteweg-de Vries Equation
AYDIN, AYHAN; Karasözen, Bülent (2008-09-20)
In this paper, the multisymplectic formulation of the CMKdV(complex modified Korteweg-de Vries equation) is derived. Based on the multisymplectic formulation, the eight-point multisymplectic Preissman scheme and a linear-nonlinear multisymplectic splitting scheme are developed. Both methods are compared numerically with respect to the conservation of local and global quantities of the CMKdV equation.
Effective optimization with weighted automata on decomposable trees
Ravve, E. V.; Volkovich, Z.; Weber, Gerhard Wilhelm (Informa UK Limited, 2014-01-02)
In this paper, we consider quantitative optimization problems on decomposable discrete systems. We restrict ourselves to labeled trees as the description of the systems and we use weighted automata on them as our computational model. We introduce a new kind of labeled decomposable trees, sum-like weighted labeled trees, and propose a method, which allows us to reduce the solution of an optimization problem, defined in a fragment of Weighted Monadic Second Order Logic, on such a tree to the solution of effec...
On the Orthogonality of q-Classical Polynomials of the Hahn Class
Alvarez-Nodarse, Renato; Adiguzel, Rezan Sevinik; Taşeli, Hasan (2012-01-01)
The central idea behind this review article is to discuss in a unified sense the orthogonality of all possible polynomial solutions of the q-hypergeometric difference equation on a q-linear lattice by means of a qualitative analysis of the q-Pearson equation. To be more specific, a geometrical approach has been used by taking into account every possible rational form of the polynomial coefficients in the q-Pearson equation, together with various relative positions of their zeros, to describe a desired q-wei...
Citation Formats
Y. Limon, “On the balanced k-chinese postmen problems,” M.S. - Master of Science, Middle East Technical University, 2015.