標(biāo)題: Titlebook: Bio-inspired Algorithms for the Vehicle Routing Problem; Francisco Babtista Pereira,Jorge Tavares Book 2009 Springer-Verlag Berlin Heidelb [打印本頁(yè)] 作者: infection 時(shí)間: 2025-3-21 18:18
書(shū)目名稱Bio-inspired Algorithms for the Vehicle Routing Problem影響因子(影響力)
書(shū)目名稱Bio-inspired Algorithms for the Vehicle Routing Problem影響因子(影響力)學(xué)科排名
書(shū)目名稱Bio-inspired Algorithms for the Vehicle Routing Problem網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Bio-inspired Algorithms for the Vehicle Routing Problem網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Bio-inspired Algorithms for the Vehicle Routing Problem被引頻次
書(shū)目名稱Bio-inspired Algorithms for the Vehicle Routing Problem被引頻次學(xué)科排名
書(shū)目名稱Bio-inspired Algorithms for the Vehicle Routing Problem年度引用
書(shū)目名稱Bio-inspired Algorithms for the Vehicle Routing Problem年度引用學(xué)科排名
書(shū)目名稱Bio-inspired Algorithms for the Vehicle Routing Problem讀者反饋
書(shū)目名稱Bio-inspired Algorithms for the Vehicle Routing Problem讀者反饋學(xué)科排名
作者: Coronary 時(shí)間: 2025-3-21 20:24 作者: Landlocked 時(shí)間: 2025-3-22 00:27 作者: 控訴 時(shí)間: 2025-3-22 06:35 作者: Itinerant 時(shí)間: 2025-3-22 10:30
Hybridizing Problem-Specific Operators with Meta-heuristics for Solving the Multi-objective Vehiclek, a few problem-specific operators, including two search operators for local exploitation and the route simulation method (RSM) for evaluating solution quality, were proposed and incorporated with a multi-objective evolutionary algorithm (MOEA). In this chapter, the operators are hybridized with se作者: Musket 時(shí)間: 2025-3-22 13:16 作者: 提煉 時(shí)間: 2025-3-22 18:01 作者: BIPED 時(shí)間: 2025-3-22 22:04
A Memetic Algorithm for a Pick-Up and Delivery Problem by Helicopter,in a set of oil platforms by one helicopter that may have to undertake several routes in sequence. Different versions of the algorithm are presented and tested on randomly generated instances as well as on real instances provided by a petroleum company. The results show that the solutions obtained a作者: 運(yùn)氣 時(shí)間: 2025-3-23 02:08 作者: diathermy 時(shí)間: 2025-3-23 06:35
https://doi.org/10.1007/978-1-349-17893-3oblems, where least-cost collection or delivery routes are designed to serve a set of customers in a transportation network. From a methodological standpoint, the review includes evolutionary algorithms, ant colony optimization, particle swarm optimization, neural networks, artificial immune systems作者: Spartan 時(shí)間: 2025-3-23 10:01 作者: bisphosphonate 時(shí)間: 2025-3-23 14:12
https://doi.org/10.1007/978-3-030-54824-7wn hard combinatorial optimization problem that seeks to design a set of non-depot returning vehicle routes in order to service a set of customers with known demands. Each customer is serviced only once by exactly one vehicle, within fixed time intervals that represent the earliest and latest times 作者: 外向者 時(shí)間: 2025-3-23 18:14
Supercooled Liquids and the Glass Transition the classical vehicle routing problem (VRP) have received much attention from the genetic algorithms (GAs) community, we find it surprising to identify only one GA in the literature for the fixed destination multi-depot vehicle routing problem (MDVRP). This paper aims to bridge this gap by proposin作者: bisphosphonate 時(shí)間: 2025-3-24 01:55 作者: 壕溝 時(shí)間: 2025-3-24 06:04
An Exactly Solvable Model: The Perceptronhe objective is to maximise the number of loads transported, while keeping to capacity and time constraints. Loads arrive while the problem is being solved, which makes it a real-time routing problem. The solver is a self-adaptive evolutionary algorithm that ensures feasible solutions at all times. 作者: 讓步 時(shí)間: 2025-3-24 08:05
https://doi.org/10.1007/978-3-030-23600-7he inventory costs, plus a set of delivery frequencies instead of a single delivery frequency for each shop. Additionally, the ITP can also be viewed as a generalisation of the Inventory Routing Problem to the multiproduct case. EVITA, standing for .olutionary .nventory and .ransportation .lgorithm,作者: 輕彈 時(shí)間: 2025-3-24 11:46 作者: CHECK 時(shí)間: 2025-3-24 17:47 作者: 減震 時(shí)間: 2025-3-24 19:45 作者: 頂點(diǎn) 時(shí)間: 2025-3-25 02:59 作者: ablate 時(shí)間: 2025-3-25 06:07
Bio-inspired Algorithms for the Vehicle Routing Problem978-3-540-85152-3Series ISSN 1860-949X Series E-ISSN 1860-9503 作者: 砍伐 時(shí)間: 2025-3-25 11:33
Francisco Babtista Pereira,Jorge TavaresComprehensive review of the most relevant bio-inspired approaches to different Vehicle Routing Problem variants作者: 裹住 時(shí)間: 2025-3-25 14:51 作者: grotto 時(shí)間: 2025-3-25 17:31 作者: Collected 時(shí)間: 2025-3-25 22:07 作者: 蚊子 時(shí)間: 2025-3-26 01:20 作者: 感情脆弱 時(shí)間: 2025-3-26 07:51 作者: 劇本 時(shí)間: 2025-3-26 10:46
A Review of Bio-inspired Algorithms for Vehicle Routing,ndpoint, the review includes evolutionary algorithms, ant colony optimization, particle swarm optimization, neural networks, artificial immune systems and hybrids. From an application standpoint, the most popular vehicle routing variants are considered, starting with the classical vehicle routing problem with capacity constraints.作者: Panther 時(shí)間: 2025-3-26 13:15 作者: 建筑師 時(shí)間: 2025-3-26 17:33
Exploiting Fruitful Regions in Dynamic Routing Using Evolutionary Computation,We investigate under what conditions the exploration of fruitful regions improves upon the effectiveness of the evolutionary algorithm. A technique called anticipatory routing is used with the aim to increase the number of successfully transported loads with respect to time and capacity constraints.作者: Canopy 時(shí)間: 2025-3-27 00:53 作者: 搜集 時(shí)間: 2025-3-27 03:15
EVITA: An Integral Evolutionary Methodology for the Inventory and Transportation Problem,in the transport costs associated to a particular set of patterns..Here we compare four different algorithms that have been employed in the literature for solving the VRP and show how the choice of the lower level algorithm (the .) can play a significant part in the performance of the whole algorithm.作者: 流出 時(shí)間: 2025-3-27 06:50 作者: COUCH 時(shí)間: 2025-3-27 10:43 作者: 拉開(kāi)這車床 時(shí)間: 2025-3-27 16:48 作者: Permanent 時(shí)間: 2025-3-27 19:15 作者: 冬眠 時(shí)間: 2025-3-27 23:54
,A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem,et, if only one run with the same parameters is allowed, it outperforms all recent heuristics except the AGES algorithm of Mester and Br?ysy (2007). Only AGES and the SEPAS method of Tarantilis (2005) do better on the second set, but GRASP×ELS improves two best-known solutions. Our algorithm is also faster than most VRP metaheuristics.作者: novelty 時(shí)間: 2025-3-28 05:19 作者: overture 時(shí)間: 2025-3-28 07:08
When the Rubber Meets the Road: Bio-inspired Field Service Scheduling in the Real World,lony Optimization (ACO), and a hybrid of ACO with GRASP (Greedy Randomized Adaptive Search Procedure). We conclude by discussing generation of ”human-friendly” solutions, through introduction of local considerations into the global optimization process.作者: 過(guò)分 時(shí)間: 2025-3-28 12:05 作者: defeatist 時(shí)間: 2025-3-28 16:11
1860-949X s areas. In this context, the development of e?cient optimization techniques is crucial. They are able to provide new and978-3-642-09887-1978-3-540-85152-3Series ISSN 1860-949X Series E-ISSN 1860-9503
