Narrow search
Showing 1 - 10 of 1,708
Cover Image
Model of using the exhaustive search algorithm in solving of Traveling Salesman Problem (TSP) on The example of the transport network optimization of Primorje-Gorski Kotar County (...
Vukmirović, Slavomir; Čapko, Zvonko; Babic, Ana - In: Embracing diversity in organisations : 7th …, (pp. 391-401). 2019
This paper considers and presents a model of the use of an exhaustive search algorithm in solving problems of a salesman on the example of the transportation network optimization of PrimorskoGoranska County. Visual and object oriented methods of modeling and programming in the design of the...
Persistent link: https://www.econbiz.de/10012118702
Cover Image
An exact method for scheduling a yard crane
Gharehgozil, Amir Hossein; Yu, Yugang; Koster, René de; … - In: European journal of operational research : EJOR 235 (2014) 2, pp. 431-447
Persistent link: https://www.econbiz.de/10010358366
Cover Image
Robust UAV mission planning
Evers, Lanah; Dollevoet, Twan; Barros, Ana Isabel; … - In: ORP 3 - OR for young researchers and practitioners, (pp. 293-315). 2014
Persistent link: https://www.econbiz.de/10010436785
Cover Image
Two mathematical formulations for the containers drayage problem with time windows
Vidović, Milorad; Nikolic, Milos; Popović, Dražen - In: The international journal of business science & applied … 7 (2012) 3, pp. 23-32
The containers drayage problem studied here arise in ISO container distribution and collecting processes, in regions which are oriented to container sea ports or inland terminals. Containers of different sizes, but mostly 20ft, and 40ft empty and/or loaded should be delivered to, or collected...
Persistent link: https://www.econbiz.de/10011896018
Cover Image
An evolutionary algorithm for a real vehicle routing problem
Adamidis, Panagiotis; Voliotis, Christos; Pliatsika, … - In: The international journal of business science & applied … 7 (2012) 3, pp. 33-41
The NP-hard Vehicle Routing Problem (VRP) is central in the optimisation of distribution networks. Its main objective is to determine a set of vehicle trips of minimum total cost. The ideal schedule will efficiently exploit the company's recourses, service all customers and satisfy the given...
Persistent link: https://www.econbiz.de/10011896021
Cover Image
A model to simulate delay in train schedule caused by crowded passengers : using a time-space network
Toriumi, Shigeki; Taguchi, Azuma; Matsumoto, Tetsuro - In: International regional science review 37 (2014) 2, pp. 225-244
Persistent link: https://www.econbiz.de/10011308222
Cover Image
A 5.875-approximation for the Traveling Tournament Problem
Westphal, Stephan; Noparlik, Karl - In: The practice and theory of automated timetabling : …, (pp. 347-360). 2014
Persistent link: https://www.econbiz.de/10010381921
Cover Image
A 2.75-approximation algorithm for the unconstrained traveling tournament problem
Imahori, Shinji; Matsui, Tomomi; Miyashiro, Ryuhei - In: The practice and theory of automated timetabling : …, (pp. 237-247). 2014
Persistent link: https://www.econbiz.de/10010381934
Cover Image
Distribution of waiting time for dynamic pickup and delivery problems
Vonolfen, Stefan; Affenzeller, Michael - In: ORP3 - Operations Research Peripatetic Postgraduate …, (pp. 359-382). 2016
Persistent link: https://www.econbiz.de/10011484216
Cover Image
Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
Domínguez, Oscar; Juan, Angel A.; Barrios, Barry; … - In: ORP3 - Operations Research Peripatetic Postgraduate …, (pp. 383-404). 2016
Persistent link: https://www.econbiz.de/10011484225