Publication

Satisficing measure approach for vehicle routing problem with time windows under uncertainty

Jingjing Jiang
2016
Journal Articles

Abstract

The complexity of evaluating chance constraints makes chance-constrained programming problem difficult to solve. One way to handle this complexity is by devising satisficing measures for the relevant uncertainties. This paper focuses on solving the stochastic vehicle routing problem with time windows (VRPTW) by Satisficing Measure Approach (SMA) that mitigates the dissatisfaction experienced by the customers. Satisficing measures are first proposed for the VRPTW with stochastic demand on various distributions to demonstrate the dependency of customers' satisfaction towards lack of inventory based on the vehicle's capacity. Similar satisficing measures are extended to VRPTW with stochastic travel times. We integrate the proposed satisficing measures into an existing tabu-search heuristics to solve a set of generalized Solomon instances in a short amount of computation time. Compared with best-known results, the SMA saves the effort to design recourse actions, applicable to many popular probability distributions and produces very competitive results. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.

Official source

https://infoscience.epfl.ch/entities/publication/613caac4-e067-4f3c-8257-4904f642ff2f

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Jingjing Jiang
2016
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/613caac4-e067-4f3c-8257-4904f642ff2f

About this result

Related concepts (32)

Stable distribution

In probability theory, a distribution is said to be stable if a linear combination of two independent random variables with this distribution has the same distribution, up to location and scale parameters. A random variable is said to be stable if its distribution is stable. The stable distribution family is also sometimes referred to as the Lévy alpha-stable distribution, after Paul Lévy, the first mathematician to have studied it. Of the four parameters defining the family, most attention has been focused on the stability parameter, (see panel).

Normal distribution

In statistics, a normal distribution or Gaussian distribution is a type of continuous probability distribution for a real-valued random variable. The general form of its probability density function is The parameter is the mean or expectation of the distribution (and also its median and mode), while the parameter is its standard deviation. The variance of the distribution is . A random variable with a Gaussian distribution is said to be normally distributed, and is called a normal deviate.

Heuristic (psychology)

Heuristics is the process by which humans use mental short cuts to arrive at decisions. Heuristics are simple strategies that humans, animals, organizations, and even machines use to quickly form judgments, make decisions, and find solutions to complex problems. Often this involves focusing on the most relevant aspects of a problem or situation to formulate a solution. While heuristic processes are used to find the answers and solutions that are most likely to work or be correct, they are not always right or the most accurate.

Related publications (30)

Valence can control the nonexponential viscoelastic relaxation of multivalent reversible gels

Hugo Camille Valentin Le Roy

Gels made of telechelic polymers connected by reversible cross-linkers are a versatile design platform for biocompatible viscoelastic materials. Their linear response to a step strain displays a fast, near-exponential relaxation when using low-valence cros ...

Amer Assoc Advancement Science2024

Beyond fine-tuning: LoRA modules boost near-OOD detection and LLM security

Pierre Vandergheynst, Milos Vasic, Renata Khasanova, Francesco Craighero

Under resource constraints, LLMs are usually fine- tuned with additional knowledge using Parameter Efficient Fine-Tuning (PEFT), using Low-Rank Adaptation (LoRA) modules. In fact, LoRA injects a new set of small trainable matrices to adapt an LLM to a new ...

2024

Beyond fine-tuning: LoRA modules boost near-OOD detection and LLM security

Pierre Vandergheynst, Milos Vasic, Renata Khasanova, Francesco Craighero

Under resource constraints, LLMs are usually fine-tuned with additional knowledge using Parameter Efficient Fine-Tuning (PEFT), using Low-Rank Adaptation (LoRA) modules. In fact, LoRA injects a new set of small trainable matrices to adapt an LLM to a new t ...

2024