Add to ORKGAbstract—Vehicle Routing problems are highly complex prob-lems for which different Artificial Intelligence techniques have been used. In this paper, we propose an agent-oriented self-organization model for the dynamic version of the problem with time windows. Our proposal is based on a space-time representation of the Action Zones of the agents, which is able to maintain a good distribution of the vehicles on the environment. This distribution answers the objective of the dynamic problem, since it allows the agents to take their decisions while anticipating future changes in the system’s parameters
Abstract. An aboundant literature on vehicle routing problems is available. However, most of the wor...
Currently most car drivers use static routing algorithms based on the shortest distance between star...
In this paper, we study the problem of designing motion strategies for a team of mobile agents, requ...
Abstract. Vehicle Routing problems are highly complex problems for which different Artificial Intell...
Vehicle routing problems are highly complex problems for which different artificial intelligence tec...
Online vehicle routing problems with time windows are highly complex problems for which different ar...
The vehicle routing problem with time windows (VRPTW) is one of the most important and widely studie...
Les autres actes de conférences de l'ESAW sont publiées par Springer dans la série LNAI: "Engineerin...
The article presents the memetic SOM, an evolutionary algorithm embedding self-organizing maps as op...
Vehicle routing problems (VRP’s) involve assigning a fleet of limited capacity service vehicles to s...
Abstract. In this paper, we propose a multi-agent approach to solve a hard combinatorial problem: th...
In this paper, we present a multiagent model in which agents have a perception upon their shared env...
The vehicle routing problem is a classical combinatorial optimization problem. This work is about a...
International audienceRouting delivery vehicles to serve customers in dynamic and uncertain environm...
Abstract — In this paper, we study the problem of designing motion strategies for a team of mobile a...
Abstract. An aboundant literature on vehicle routing problems is available. However, most of the wor...
Currently most car drivers use static routing algorithms based on the shortest distance between star...
In this paper, we study the problem of designing motion strategies for a team of mobile agents, requ...
Abstract. Vehicle Routing problems are highly complex problems for which different Artificial Intell...
Vehicle routing problems are highly complex problems for which different artificial intelligence tec...
Online vehicle routing problems with time windows are highly complex problems for which different ar...
The vehicle routing problem with time windows (VRPTW) is one of the most important and widely studie...
Les autres actes de conférences de l'ESAW sont publiées par Springer dans la série LNAI: "Engineerin...
The article presents the memetic SOM, an evolutionary algorithm embedding self-organizing maps as op...
Vehicle routing problems (VRP’s) involve assigning a fleet of limited capacity service vehicles to s...
Abstract. In this paper, we propose a multi-agent approach to solve a hard combinatorial problem: th...
In this paper, we present a multiagent model in which agents have a perception upon their shared env...
The vehicle routing problem is a classical combinatorial optimization problem. This work is about a...
International audienceRouting delivery vehicles to serve customers in dynamic and uncertain environm...
Abstract — In this paper, we study the problem of designing motion strategies for a team of mobile a...
Abstract. An aboundant literature on vehicle routing problems is available. However, most of the wor...
Currently most car drivers use static routing algorithms based on the shortest distance between star...
In this paper, we study the problem of designing motion strategies for a team of mobile agents, requ...