17 results for “Vehicle Routing Problem”

Set a search alert

Research ArticleOpen accessIn the abstractA Randomized Population Constructive Heuristic for the Team Orienteering ProblemManal ZettamThe NP-hard (complete) team orienteering problem is a particular vehicle routing problem with the aim of maximizing the profits gained from visiting control points without exceeding a travel cost limit. The team orienteering problem has a number of applications in several fields such as athlete recruiting, technician routing and tourist trip. Therefore, solving optimally the team orienteering problem would play … …Journal of Computer Science, Vol. 13, Issue 9 · 17 Jun 2017 · 8,285 accessesView PDF Cite

Research ArticleOpen accessIn the abstractOptimizing the Newspaper Distribution Scenarios using Genetic Algorithm: A Case Study of IndiaSachin Suresh Kamble, Rakesh Raut, Shradha Ashok GawankarThis paper attempts to optimize the various newspaper distribution scenario as observed in India. It found from the literature that earlier research work carried out in optimizing the vehicle routing networks problem using time window and scope was limited to distribution from newspaper printing location to the vendor point of distribution. This paper focuses on the distribution of newspaper from … …American Journal of Applied Sciences, Vol. 14, Issue 4 · 12 Apr 2017 · 8,187 accessesView PDF Cite

Research ArticleOpen accessIn the abstractPerformance Evaluation of Probabilistic Relay in Ad Hoc On-demand Distance Vector and Ad Hoc On-demand Multipath Distance Vector Under Highly Dynamic EnvironmentsRadityo Anggoro, Teruaki Kitasuka, Ryoji Nakamura, Masayoshi AritsugiVehicular Ad hoc Networks (VANETs) are a specific class of Mobile Ad hoc Networks (MANETs). Since vehicles tend to move in a high speed, the network topology is rapidly changed. Thus vehicle’s connectivity problem is one of the interesting issues in VANETs. Ad hoc On-demand Multipath Distance Vector (AOMDV) is an extended version of ad hoc on-demand distance vector (AODV). … …Journal of Computer Science, Vol. 9, Issue 7 · 22 Jun 2013 · 7,050 accessesView PDF Cite

Research ArticleOpen accessIn the abstractFlow Based AlgorithmT. Karpagam, V. J. Sudhakar, N. Arunsankar, M. DhanasekaranProblem statement: Network topology design problems find application in several real life scenario. Approach: Most designs in the past either optimize for a single criterion like shortest or cost minimization or maximum flow. Results: This study discussed about solving a multi objective network topology design problem for a realistic traffic model specifically in the pipeline transportation. Here flow based algorithm … …American Journal of Applied Sciences, Vol. 9, Issue 2 · 22 Dec 2011 · 8,482 accessesView PDF Cite

Research ArticleOpen accessIn the abstractAnt Colony Optimization for Solving Solid Waste Collection Scheduling ProblemsZ. Ismail, S. L. LohProblem statement: Southern Waste Management environment (SWM environment) is a company responsible for the collection and disposal of solid waste for the city of Johor Bahru, a city with over one million populations. The company is implementing an integrated solid waste management system where it involved in the optimization of resources to ensure the effectiveness of its services. Formulating this … …Journal of Mathematics and Statistics, Vol. 5, Issue 3 · 30 Sep 2009 · 8,015 accessesView PDF Cite

Research ArticleOpen accessIn the abstractDynamic Traffic Light Sequence Algorithm Using RFIDKhalid A.S. Al-Khateeb, Jaiz A.Y. Johari, Wajdi F. Al-KhateebProblem statement: Traffic congestion and tidal flow management were recognized as major problems in modern urban areas, which have caused much frustration and loss of man hours. Approach: In order to solve the problem an intelligent RFID traffic control has been developed. It has circumvented or avoided the problems that usually arise with systems such as those, which use image … …Journal of Computer Science, Vol. 4, Issue 7 · 31 Jul 2008 · 21,773 accessesView PDF Cite

Research ArticleOpen accessIn the abstractApplication of Harmony Search to Vehicle RoutingZong Woo Geem, Kang Seok Lee, Yongjin ParkA phenomenon-inspired meta-heuristic algorithm, harmony search, imitating music improvisation process, is introduced and applied to vehicle routing problem, then compared with one of the popular evolutionary algorithms, genetic algorithm. The harmony search algorithm conceptualized a group of musicians together trying to search for better state of harmony. This algorithm was applied to a test traffic network composed of one bus … …American Journal of Applied Sciences, Vol. 2, Issue 12 · 31 Dec 2005 · 12,460 accessesView PDF Cite