Sciweavers

95 search results - page 4 / 19
» The vehicle rescheduling problem: Model and algorithms
Sort
View
CP
1997
Springer
15 years 1 months ago
GENIUS-CP: a Generic Single-Vehicle Routing Algorithm
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
IJFCS
2006
106views more  IJFCS 2006»
14 years 9 months ago
A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teru...
ATVA
2004
Springer
146views Hardware» more  ATVA 2004»
15 years 3 months ago
A Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
Tadaaki Tanimoto, Suguru Sasaki, Akio Nakata, Teru...
AAAI
2000
14 years 11 months ago
Solving a Supply Chain Optimization Problem Collaboratively
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory m...
Hoong Chuin Lau, Andrew Lim, Qi Zhang Liu
EVOW
2012
Springer
13 years 5 months ago
Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles
This work deals with the application of metaheuristics to the fuel consumption minimization problem of hybrid electric vehicles (HEV) considering exactly specified driving cycles....
Thorsten Krenek, Mario Ruthmair, Günther R. R...