Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRP

Adam: метод стохастической оптимизации
Diederik P. Kingma, Jimmy Lei Ba, Bucarey, Víctor, Guns, Tias, Schulman, Rebecca, Chen, Kuan-Lin, Mandi, Jayanta, Canoy, Rocsildes, Linder, Johannes, Chen, Yuan-Jyue, Wong, David, Seelig, Georg, Ceze, Luis, Strauss, Karin, Jayanta Mandi, Rocsildes Canoy, Víctor Bucarey L., Tias Guns
2021-01-01

DNA-co-polymerized hydrogelscoarse-grained simulationconvolutional neural networkgenetic algorithmmetamorphic material design
The traditional Capacitated Vehicle Routing Problem (CVRP) minimizes the total distance of the routes under the capacity constraints of the vehicles. But more often, the objective involves multiple criteria including not only the total distance of the tour but also other factors such as travel costs, travel time, and fuel consumption. Moreover, in reality, there are numerous implicit preferences ingrained in the minds of the route planners and the drivers. Drivers, for instance, have familiarity with certain neighborhoods and knowledge of the state of roads, and often consider the best places for rest and lunch breaks. This knowledge is difficult to formulate and balance when operational routing decisions have to be made. This motivates us to learn the implicit preferences from past solutions and to incorporate these learned preferences in the optimization process. These preferences are in the form of arc probabilities, i.e., the more preferred a route is, the higher is the joint probability. The novelty of this work is the use of a neural network model to estimate the arc probabilities, which allows for additional features and automatic parameter estimation. This first requires identifying suitable features, neural architectures and loss functions, taking into account that there is typically few data available. We investigate the difference with a prior weighted Markov counting approach, and study the applicability of neural networks in this setting.
1
A computational framework combines coarse-grained simulation, convolutional neural network scoring, and genetic algorithms to optimize metamorphic DNA-co-polymerized hydrogel designs.
2
The method autonomously explores a large design space by classifying and scoring simulated hydrogel geometries and evolving batches of candidate designs.
3
The method discovers hydrogel designs capable of transforming into multiple Arabic numerals across different actuation states.
4
The optimization process identifies important material parameters and traits governing hydrogel shape transformation.
5
The study reveals relationships between material scale and the achievable range of shape changes within individual domains, along with trade-offs among design parameters.

Metamorphic DNA-co-polymerized hydrogel structures designed to fold into different shapes (Arabic numerals) under different actuation states

design-space exploration and optimization of hydrogel shape-changing behavior, including scale–shape-change relationships and multi-digit transformation

Publication Details
Publication Date
2021-01-01
Journal
Publisher
ISSN
Cited by
9
Access Type
Author Information
Authors
Diederik P. Kingma
Jimmy Lei Ba
Bucarey, Víctor
Guns, Tias
Schulman, Rebecca
Chen, Kuan-Lin
Mandi, Jayanta
Canoy, Rocsildes
Linder, Johannes
Chen, Yuan-Jyue
Wong, David
Seelig, Georg
Ceze, Luis
Strauss, Karin
Jayanta Mandi
Rocsildes Canoy
Víctor Bucarey L.
Tias Guns
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat →
Make a presentation
100%