The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Our online algorithm uses a linear time algorithm for the offline postman problem with a penalty at most |V|—1. Thus, the minimum penalty does not exceed |V'| — 1 for every connected graph G. ... with a small penalty. ...
In this respect, the problem was modeled as multi depot k-Chinese postman problem, a type of arc routing problem. This mathematical model was solved by genetic algorithm. ... For comparison, the current solution, Clarke and Wright Algorithm and Sweep Algorithm were used. ... to primarily the traffic problem in Istanbul, which has been growing for years. ...doi:10.5195/emaj.2015.69 fatcat:2xorvfrsjvairauwjardmzgzhi
Pruhs, Online weighted flow time and deadline scheduling (36—47); Piotr Berman and Junichiro Fukuyama, An online algorithm for the postman problem with a small penalty (48-54); Adriana Bumb and Walter ... Kern, A simple dual ascent algorithm for the multilevel facility location problem (55-62). ...
programming model with stochastic constraints is constructed taking the shortest path of all vehicles for a delivering (recycling) operation as an objective. ... For the characteristics of the model, a hybrid intelligent algorithm including stochastic simulation, neural network, and immune clonal algorithm is designed to solve the model. ... Acknowledgments This work is partially supported by the National Basic Research Program of China (no. 2012CB725403) and the National Natural Science Foundation of China (no. 61374202). ...doi:10.1155/2016/5691735 pmid:27528865 pmcid:PMC4977415 fatcat:doe7jabdxzhojovvgnyqzifmvq
Lecture Notes in Computer Science
Our results include a polynomial time algorithm on paths and an approximation algorithm on general graphs with a performance of 9/4. For trees we improve the performance to 5/3. ... In this paper we study algorithms for "Dial-a-Ride" transportation problems. ... In [FHK78] the authors present a 9/5-approximation algorithm for the problem on general graphs. An improved algorithm for trees with performance 5/4 is given in [FG93] . ...doi:10.1007/3-540-46784-x_6 fatcat:hd7zy2k76rettajatqlakotgdm
In order to get the best results with a view to directing TSP heuristics, the ant colony algorithm was used for solution purposes. ... The purpose was to solve the problem of setting a course for the bread distribution trucks of Istanbul Halk Ekmek (Public Bread) Company using the ant colony algorithm on TSP. ... The problem arose with the necessity for a postman to distribute letters he receives from a postal office by visiting all the streets in the city in the shortest possible way. ...doi:10.29121/ijetmr.v4.i12.2017.132 fatcat:a3lqzrjsdbedlk7vnxqm35yyri
CARP, the multi-depot CARP, and the min-max k-vehicles windy rural postman problem, with a total of 1528 instances. ... We also report sensitivity analyses for new MCGRP instances with turn penalties, which are uncommonly challenging yet critical for many practical applications. ... The first set, CMMS, extends the 21 mixed rural postman problem instances with turn penalties from Table 3 of Corberán et al. (2002) . ...doi:10.1287/opre.2017.1595 fatcat:dstgytudz5f5xiczklcmowvrui
Performance of the algorithms was evaluated by compar- ing the solution values of the algorithms with optimal solution values obtained by a full enumeration method (for small-sized test problems with 7 ... For an arc-welding robot scheduling problem with the objective of minimizing the cycle time, Rubinovitz and Wysk”° suggest a heuristic algorithm based on a well-known TSP heuristic, the nearest-neighbour ...doi:10.1057/palgrave.jors.2601803 fatcat:kthf37xlwfgtraijgz75753gny
GLS is a penalty-based meta-heuristic algorithm that sits on top of other local search algorithms, with the aim to improve their efficiency and robustness. ... FLS is a way of reducing the size of the neighbourhood to improve the efficiency of local search. The chapter also provides guidance for implementing and using GLS and FLS. ... The neighbourhood choosen for the problem is broken down into a number of small sub-neighbourhoods and an activation bit is attached to each one of them. ...doi:10.1007/978-1-4419-1665-5_11 fatcat:ams2rkjwrnd5bfbvt7xs3nge3e
We describe a solution approach based on a reformulation to an asymmetric traveling salesman problem in an extended graph, plus a heuristic for finding feasible solutions. ... We address the problem facing a single vehicle, including details such as precedence requirements and turning penalties. ... Let us now give an algorithm for this. Let t V denote the "freeing time" for the vehicle, i.e. when it will be free for new tasks. ...doi:10.1287/trsc.2018.0851 fatcat:pwqjjtm6zrfujae7heybrup7rm
This is the second of two papers with an annotated bibliography of the GRASP literature from 1989 to 2008. In the companion paper, algorithmic aspects of GRASP are surveyed. ... A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. ... This paper proposes a GRASP for the mixed postman problem. M.G.C. Resende and C.C. Ribeiro. A GRASP with path-relinking for private virtual Lim and F. Wang. ...doi:10.1111/j.1475-3995.2009.00664.x fatcat:wdqwc6xvcnfq3fi5ujy6jy5wtm
RoCKIn - Benchmarking Through Robot Competitions
By doing so, RoCKIn set in motion an evolutionary process to transform robot competitions from successful showcases with limited scientific impact into benchmarking tools for the consistent and objective ... Our work began by revisiting, in the light of the features and limitations of a competition setting, the very foundations of the scientific method; then we built on these by designing a novel type of competitions ... with the Deli Man. • The robot exhibits the expected behaviour for interacting with the Postman. • The robot exhibits the expected behaviour for interacting with an unknown person. ...doi:10.5772/intechopen.70013 fatcat:xajdphumrjbjnkg2n5wg23xqbe
As an example, most of the programming contests use an automatic evaluation of the contestants' submissions. While this approach is clearly highly efficient, it also has some drawbacks. ... The discussion is focused on programming contests, but the results can be applied for any programming tasks, e.g., assignments in school. ... of these inputs for a penalty.) ...doaj:d54baeb02e554c8dbe629d974e7ee085 fatcat:w7yggymb5bdjdenfmdvo5mlree
Compared with the previous bio-heuristic algorithms, the algorithm proposed in this paper has advantages of a wide search range and breakneck search speed, which resolves the contradictory requirements ... Moreover, comparisons with other existing algorithms further demonstrate the superiority of the proposed OABAS algorithm. ... Conflicts of Interest: The authors declare no conflict of interest. ...doi:10.3390/s19081758 fatcat:veret6anrretxasr42hg4bxb7y
Finally, solving for the minimal length path through a route optimization algorithm on these graphs provides an abstraction of harmonic sequences that can be generalized for the conception of generative ... We introduce the concept of dynamical score networks for the representation and analysis of tonal compositions: a score is interpreted as a dynamical network where every chord is a node and each progression ... Acknowledgements I wish to thank Dmitry Tymoczko and Mark Newman for long and stimulating discussions, the reviewers of this paper and Ian Quinn for their careful and detailed comments and suggestions. ...arXiv:2006.01033v2 fatcat:zqygcmotfnfcboaaqopf7xdoqe
« Previous Showing results 1 — 15 out of 130 results