Concept

Problème de tournées de véhicules

Publications associées (106)

A ride time-oriented scheduling algorithm for dial-a-ride problems

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Pergamon-Elsevier Science Ltd2024

Differentially private multi-agent constraint optimization

Boi Faltings, Sujit Prakash Gujar, Aleksei Triastcyn, Sankarshan Damle

Distributed constraint optimization (DCOP) is a framework in which multiple agents with private constraints (or preferences) cooperate to achieve a common goal optimally. DCOPs are applicable in several multi-agent coordination/allocation problems, such as ...

Dordrecht2024

The Two Times Problem: Where Is the Problem?

Michael Herzog

Gruber et al. (2022) offered a framework how to explain "Physical time within human time", solving the 'two times problem: Here, I am asking whether such a problem exists at all. To question the question, I will appeal to neurobiological, evolutionary, and ...

Brill2024

Modelling and solving a real-world truck-trailer scheduling problem in container transportation with separate moving objects

Thanh Trung Huynh, Van Son Nguyen

Container transportation is pivotal in global supply chains, facilitating the exchange of goods between companies across different countries. Given the exceedingly high operational costs of transporting containers, optimizing itinerary schedules can yield ...

New Delhi2024

A continuum approximation approach to the depot location problem in a crowd-shipping system

Nikolaos Geroliminis, Patrick Stefan Adriaan Stokkink

Last-mile delivery in the logistics chain contributes to congestion in urban networks due to frequent stops. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery but relies heavily on the availability of occasional couriers. In ...

PERGAMON-ELSEVIER SCIENCE LTD2023

Design and experimental investigation of a herringbone grooved gas bearing supported turbocharger

Jürg Alexander Schiffmann, Wanhui Liu

The design of an oil free turbocharger supported on herringbone grooved gas bearing was formulated as a multi-objective problem, which was solved by coupling a reduced order parametric model for gas bearing supported rotors with an evolutionary algorithm. ...

2023

Multi-robot task allocation for safe planning against stochastic hazard dynamics

Maryam Kamgarpour, Orcun Karaca

We address multi-robot safe mission planning in uncertain dynamic environments. This problem arises in several applications including safety-critical exploration, surveillance, and emergency rescue missions. Computation of a multi-robot optimal control pol ...

2023

Learning to make mixed-integer robot motion planning easy

Tanguy Hector Lewko

Robot motion planning involves finding a feasible path for a robot to follow while satisfying a set of constraints and optimizing an objective function. This problem is critical for enabling robots to navigate and perform tasks in realworld environments. H ...

2023

Dual-function engineering to construct ultra-stable anodes for potassium-ion hybrid capacitors: N, O-doped porous carbon spheres

Yanan Chen, Kangning Zhao, Chao Yang, Jie Xu, Xin Peng, Wen Liu, Wei Zhou

Heteroatom doping engineering is deemed to be an adoptable strategy to boost the potassium (K) storage performance of carbonaceous materials. The inevitable issue for this strategy lies in the huge volume expansion originated from the large radius of K+. I ...

ELSEVIER2022

Safe Motion Planning against Multimodal Distributions Based on a Scenario Approach

Maryam Kamgarpour

We present the design of a motion planning algorithm that ensures safety for an autonomous vehicle. In particular, we consider a multimodal distribution over uncertainties; for example, the uncertain predictions of future trajectories of surrounding vehicl ...

2022

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search