Exact and Heuristic Methods to Solve the Berth Allocation Problem in Bulk Ports

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.

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

Omnichannel retail has emerged as the new standard in today's commerce landscape, with retailers integrating their physical and online channels to enhance the customer shopping experience. However, such integration presents significant challenges for retai ...

As historical stone masonry structures are vulnerable and prone to damage in earthquakes, investigating their structural integrity is important to reduce injuries and casualties while preserving their historical value. Stone masonry is a composite material ...

Cells are promising as carriers that can enhance the delivery of nanomedicines. Cells that carry nanomedicinal cargo, either immobilized on the cell surface or internalized, can allow for highly specific delivery and can enable the transport of nanomedicin ...

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius rho such that there exist balls of radius rho aro ...

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius ρ such that there exist balls of radius ρ around ...

This thesis develops mathematical programming frameworks to operate electric autonomous vehicles in the context of ride-sharing services. The introduced problem is a novel variant of the Dial-a-Ride Problem (DARP), denoted by the electric Autonomous Dial-a ...

Assortment planning deserves much attention from practitioners and academics due to its direct impact on retailers' commercial success. In this paper we focus on the increasingly popular retail practice to use combined product assortments with both "standa ...

In this article, the design of a quality control network is considered in an entire supply chain, in the context of an international food and beverage company, denoted as ABC. For each possible control point of the network, two decisions have to be made: ( ...

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

The biosynthesis of coenzyme Q presents a paradigm for how cells surmount hydrophobic barriers in lipid biology. In eukaryotes, CoQ precursors-among nature's most hydrophobic molecules-must somehow be presented to a series of enzymes peripherally associate ...

Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually, passenger inconvenience. This thesis focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of lar ...

We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our result confirms the conjectured constant integrality gap of th ...

Atomistic/continuum (A/C) coupling schemes have been developed during the past twenty years to overcome the vast computational cost of fully atomistic models, but have not yet reached full maturity to address many problems of practical interest. This work ...

Clustering is a classic topic in combinatorial optimization and plays a central role in many areas, including data science and machine learning. In this thesis, we first focus on the dynamic facility location problem (i.e., the facility location problem in ...

Phasor measurement units (PMUs) deployed to monitor the state of an electrical grid need to be patched from time to time to prevent attacks that exploit vulnerabilities in the software. Applying some of these patches requires a PMU reboot, which takes the ...

An aerial vehicle, configured to transport cargo, and including a propulsion system and a foldable cage is described. The foldable cage is substantially linear while in a folded configuration, and substantially circular while in a deployed configuration. M ...

Background: The gene family-free framework for comparative genomics aims at providing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity graph. We study two problems related to the b ...

This paper presents an integrated approach for short-term supply chain management (SCM) at a fast moving consumer goods production plant. The problem is to determine the production quantities, to provide a detailed production schedule, to trigger the relev ...

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Exact and Heuristic Methods to Solve the Berth Allocation Problem in Bulk Ports

Chattez avec Graph Search

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Quantitative Methods for Omnichannel Decision-Making

Geometrical Treatise on the Modelling of 3D Particulate Inclusion-Matrix Microstructures with an Application to Historical Stone Masonry Walls

Chemical Cell Surface Modification and Analysis of Nanoparticle-Modified Living Cells

Fair colorful k-center clustering

Fair Colorful k-Center Clustering

The electric autonomous dial-a-ride problem

Product assortment and space allocation strategies to attract loyal and non-loyal customers

Design of a quality control network for an international food company

New Graph Algorithms via Polyhedral Techniques

An Isoprene Lipid-Binding Protein Promotes Eukaryotic Coenzyme Q Biosynthesis

Integration of passenger satisfaction in railway timetable rescheduling for major disruptions

A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

On flexible Green function methods for atomistic/continuum coupling

Algorithms For Clustering Problems : Theoretical Guarantees and Empirical Evaluations

Optimal Software Patching Plan for PMUs

Foldable aircraft with protective cage for transportation and transportability

The gene family-free median of three

Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions

Dynamic Facility Location via Exponential Clocks