Heuristic algorithms for the routing problems with backhauls

Download
116468.pdf
2001
Demirel, Özgür
Show full item record
54
views
0
downloads
https://hdl.handle.net/11511/11526
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Heuristic procedures for the lot sizing problem with assembly structures
İrfanoğlu, Orhan; Kırca, Ömer; Department of Industrial Engineering (1990)
Heuristic procedures for multi-item dynamic lot sizing problem with set-up times
Uluöz, B Deniz; Kırca, Ömer; Department of Industrial Engineering (1988)
Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy
Randa, A. Cem; Dogru, Mustafa K.; İyigün, Cem; Ozen, Ulas (Elsevier BV, 2019-09-01)
We consider a lot-sizing problem in a single-item single-stage production system facing non-stationary stochastic demand in a finite planning horizon. Motivated by common practice, the set-up times need to be determined and frozen once and for all at the beginning of the horizon while decisions on the exact lot sizes can be deferred until the setup epochs. This operating scheme is referred to as the static dynamic uncertainty strategy in the literature. It has been shown that a modified base stock policy is...
Heuristic approaches for solid transportation-p-facility location problem
Das, Soumen Kumar; Roy, Sankar Kumar; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2020-09-01)
Determining optimum places for the facilities and optimum transportation from existing sites to the facilities belongs to the main problems in supply chain management. Thesolid transportation-p-facility location problem(ST-p-FLP) is an integration between thefacility location problemand thesolid transportation problem(STP). This paper delineates the ST-p-FLP, a generalization of the classical STP in which location ofp-potential facility sites are sought so that the total transportation cost by means of conv...
Heuristic methods for the stochastic lot-sizing problem under the static-dynamic uncertainty strategy
Randa, Ali Cem; İyigün, Cem; Department of Industrial Engineering (2013)
We consider a lot-sizing problem in a single-item single-stage production system facing nonstationary stochastic demand in a finite planning horizon. Motivated by practice, the set-up times need to be determined and frozen once and for all at the beginning of the horizon while decision on the exact lot sizes can be deferred until the setup time. This operating scheme is referred to as the static-dynamic uncertainty strategy in the literature. For a capacitated system with minimum lot size restrictions, it h...
Citation Formats
Ö. Demirel, “Heuristic algorithms for the routing problems with backhauls,” Middle East Technical University, 2001.
METU IIS - Integrated Information Service open@metu.edu.tr