Ontology type: schema:Chapter
2014-02-21
AUTHORSJuan-Antonio Sicilia , David Escuín , Beatriz Royo , Emilio Larrodé , Jesús Medrano
ABSTRACTThis chapter presents a hybrid algorithm based on metaheuristic methods (Variable Neighbourhood Search and Tabu Search) and local improvements to solve the problem of the distribution of goods in large urban areas taking into account the characteristics encountered in real life. The logistics of the short distance transport of goods has an essentially urban dimension so that distribution requires efficient algorithms and the process between warehouses and customers must be effective and clean. Therefore, it is necessary to efficiently optimize urban logistics and improve connections between urban and interurban freight transport in order to ensure effective distribution. Due to the great variety of constraints and complexities of the problem, known as the General Vehicle Routing Problem, the algorithm proposes feasible solutions in order to achieve the main objective of reducing costs based on minimizing distances and reducing the number of vehicles used as long as the service quality to customers is optimum and a load balance between vehicles is maintained. This article arises from a research project carried out for a large Spanish distribution company aiming to optimally manage its resources in urban areas by reducing as much as possible costs caused by inefficiency and ineffectiveness. More... »
PAGES463-475
Computer-based Modelling and Optimization in Transportation
ISBN
978-3-319-04629-7
978-3-319-04630-3
http://scigraph.springernature.com/pub.10.1007/978-3-319-04630-3_34
DOIhttp://dx.doi.org/10.1007/978-3-319-04630-3_34
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1005152098
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Computation Theory and Mathematics",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Department of Mechanical Engineering, University of Zaragoza, Mar\u00eda de Luna 3, 50018, Zaragoza, Spain",
"id": "http://www.grid.ac/institutes/grid.11205.37",
"name": [
"Department of Mechanical Engineering, University of Zaragoza, Mar\u00eda de Luna 3, 50018, Zaragoza, Spain"
],
"type": "Organization"
},
"familyName": "Sicilia",
"givenName": "Juan-Antonio",
"id": "sg:person.016663220241.96",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016663220241.96"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Instituto Tecnol\u00f3gico de Arag\u00f3n, Mar\u00eda de Luna 1, 50018, Zaragoza, Spain",
"id": "http://www.grid.ac/institutes/grid.16189.37",
"name": [
"Instituto Tecnol\u00f3gico de Arag\u00f3n, Mar\u00eda de Luna 1, 50018, Zaragoza, Spain"
],
"type": "Organization"
},
"familyName": "Escu\u00edn",
"givenName": "David",
"id": "sg:person.014021007731.39",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014021007731.39"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Mechanical Engineering, University of Zaragoza, Mar\u00eda de Luna 3, 50018, Zaragoza, Spain",
"id": "http://www.grid.ac/institutes/grid.11205.37",
"name": [
"Department of Mechanical Engineering, University of Zaragoza, Mar\u00eda de Luna 3, 50018, Zaragoza, Spain"
],
"type": "Organization"
},
"familyName": "Royo",
"givenName": "Beatriz",
"id": "sg:person.012404521747.00",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012404521747.00"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Mechanical Engineering, University of Zaragoza, Mar\u00eda de Luna 3, 50018, Zaragoza, Spain",
"id": "http://www.grid.ac/institutes/grid.11205.37",
"name": [
"Department of Mechanical Engineering, University of Zaragoza, Mar\u00eda de Luna 3, 50018, Zaragoza, Spain"
],
"type": "Organization"
},
"familyName": "Larrod\u00e9",
"givenName": "Emilio",
"id": "sg:person.014125600437.78",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014125600437.78"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Mechanical Engineering, University of Zaragoza, Mar\u00eda de Luna 3, 50018, Zaragoza, Spain",
"id": "http://www.grid.ac/institutes/grid.11205.37",
"name": [
"Department of Mechanical Engineering, University of Zaragoza, Mar\u00eda de Luna 3, 50018, Zaragoza, Spain"
],
"type": "Organization"
},
"familyName": "Medrano",
"givenName": "Jes\u00fas",
"type": "Person"
}
],
"datePublished": "2014-02-21",
"datePublishedReg": "2014-02-21",
"description": "This chapter presents a hybrid algorithm based on metaheuristic methods (Variable Neighbourhood Search and Tabu Search) and local improvements to solve the problem of the distribution of goods in large urban areas taking into account the characteristics encountered in real life. The logistics of the short distance transport of goods has an essentially urban dimension so that distribution requires efficient algorithms and the process between warehouses and customers must be effective and clean. Therefore, it is necessary to efficiently optimize urban logistics and improve connections between urban and interurban freight transport in order to ensure effective distribution. Due to the great variety of constraints and complexities of the problem, known as the General Vehicle Routing Problem, the algorithm proposes feasible solutions in order to achieve the main objective of reducing costs based on minimizing distances and reducing the number of vehicles used as long as the service quality to customers is optimum and a load balance between vehicles is maintained. This article arises from a research project carried out for a large Spanish distribution company aiming to optimally manage its resources in urban areas by reducing as much as possible costs caused by inefficiency and ineffectiveness.",
"editor": [
{
"familyName": "de Sousa",
"givenName": "Jorge Freire",
"type": "Person"
},
{
"familyName": "Rossi",
"givenName": "Riccardo",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-319-04630-3_34",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-319-04629-7",
"978-3-319-04630-3"
],
"name": "Computer-based Modelling and Optimization in Transportation",
"type": "Book"
},
"keywords": [
"hybrid algorithm",
"general vehicle routing problems",
"vehicle routing problem",
"load balance",
"number of vehicles",
"efficient algorithm",
"metaheuristic methods",
"routing problem",
"feasible solution",
"algorithm",
"service quality",
"general vehicles",
"real life",
"effective distribution",
"customers",
"local improvement",
"urban logistics",
"distribution companies",
"logistics",
"distribution of goods",
"vehicles",
"possible cost",
"warehouse",
"urban freight distribution",
"research project",
"main objective",
"cost",
"complexity",
"constraints",
"freight distribution",
"freight transport",
"resources",
"large urban areas",
"order",
"companies",
"great variety",
"Minimizing Distance",
"inefficiency",
"project",
"urban areas",
"solution",
"quality",
"method",
"connection",
"improvement",
"area",
"goods",
"process",
"number",
"variety",
"distance",
"objective",
"chapter",
"dimensions",
"article",
"account",
"distribution",
"characteristics",
"cases",
"balance",
"life",
"ineffectiveness",
"short-distance transport",
"transport",
"problem",
"distance transport",
"urban dimension"
],
"name": "A Hybrid Algorithm for Solving the General Vehicle Routing Problem in the Case of the Urban Freight Distribution",
"pagination": "463-475",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1005152098"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-319-04630-3_34"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-319-04630-3_34",
"https://app.dimensions.ai/details/publication/pub.1005152098"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:36",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_115.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-319-04630-3_34"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-04630-3_34'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-04630-3_34'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-04630-3_34'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-04630-3_34'
This table displays all metadata directly associated to this object as RDF triples.
162 TRIPLES
23 PREDICATES
91 URIs
84 LITERALS
7 BLANK NODES
Subject | Predicate | Object | |
---|---|---|---|
1 | sg:pub.10.1007/978-3-319-04630-3_34 | schema:about | anzsrc-for:08 |
2 | ″ | ″ | anzsrc-for:0802 |
3 | ″ | schema:author | Nba70fd7751d44e4a831896f5bb8e56ce |
4 | ″ | schema:datePublished | 2014-02-21 |
5 | ″ | schema:datePublishedReg | 2014-02-21 |
6 | ″ | schema:description | This chapter presents a hybrid algorithm based on metaheuristic methods (Variable Neighbourhood Search and Tabu Search) and local improvements to solve the problem of the distribution of goods in large urban areas taking into account the characteristics encountered in real life. The logistics of the short distance transport of goods has an essentially urban dimension so that distribution requires efficient algorithms and the process between warehouses and customers must be effective and clean. Therefore, it is necessary to efficiently optimize urban logistics and improve connections between urban and interurban freight transport in order to ensure effective distribution. Due to the great variety of constraints and complexities of the problem, known as the General Vehicle Routing Problem, the algorithm proposes feasible solutions in order to achieve the main objective of reducing costs based on minimizing distances and reducing the number of vehicles used as long as the service quality to customers is optimum and a load balance between vehicles is maintained. This article arises from a research project carried out for a large Spanish distribution company aiming to optimally manage its resources in urban areas by reducing as much as possible costs caused by inefficiency and ineffectiveness. |
7 | ″ | schema:editor | Nd1279b048a3c41e4ac70511e5c49cfe7 |
8 | ″ | schema:genre | chapter |
9 | ″ | schema:inLanguage | en |
10 | ″ | schema:isAccessibleForFree | false |
11 | ″ | schema:isPartOf | N44d99aa5c6724b509f13b979a1e13922 |
12 | ″ | schema:keywords | Minimizing Distance |
13 | ″ | ″ | account |
14 | ″ | ″ | algorithm |
15 | ″ | ″ | area |
16 | ″ | ″ | article |
17 | ″ | ″ | balance |
18 | ″ | ″ | cases |
19 | ″ | ″ | chapter |
20 | ″ | ″ | characteristics |
21 | ″ | ″ | companies |
22 | ″ | ″ | complexity |
23 | ″ | ″ | connection |
24 | ″ | ″ | constraints |
25 | ″ | ″ | cost |
26 | ″ | ″ | customers |
27 | ″ | ″ | dimensions |
28 | ″ | ″ | distance |
29 | ″ | ″ | distance transport |
30 | ″ | ″ | distribution |
31 | ″ | ″ | distribution companies |
32 | ″ | ″ | distribution of goods |
33 | ″ | ″ | effective distribution |
34 | ″ | ″ | efficient algorithm |
35 | ″ | ″ | feasible solution |
36 | ″ | ″ | freight distribution |
37 | ″ | ″ | freight transport |
38 | ″ | ″ | general vehicle routing problems |
39 | ″ | ″ | general vehicles |
40 | ″ | ″ | goods |
41 | ″ | ″ | great variety |
42 | ″ | ″ | hybrid algorithm |
43 | ″ | ″ | improvement |
44 | ″ | ″ | ineffectiveness |
45 | ″ | ″ | inefficiency |
46 | ″ | ″ | large urban areas |
47 | ″ | ″ | life |
48 | ″ | ″ | load balance |
49 | ″ | ″ | local improvement |
50 | ″ | ″ | logistics |
51 | ″ | ″ | main objective |
52 | ″ | ″ | metaheuristic methods |
53 | ″ | ″ | method |
54 | ″ | ″ | number |
55 | ″ | ″ | number of vehicles |
56 | ″ | ″ | objective |
57 | ″ | ″ | order |
58 | ″ | ″ | possible cost |
59 | ″ | ″ | problem |
60 | ″ | ″ | process |
61 | ″ | ″ | project |
62 | ″ | ″ | quality |
63 | ″ | ″ | real life |
64 | ″ | ″ | research project |
65 | ″ | ″ | resources |
66 | ″ | ″ | routing problem |
67 | ″ | ″ | service quality |
68 | ″ | ″ | short-distance transport |
69 | ″ | ″ | solution |
70 | ″ | ″ | transport |
71 | ″ | ″ | urban areas |
72 | ″ | ″ | urban dimension |
73 | ″ | ″ | urban freight distribution |
74 | ″ | ″ | urban logistics |
75 | ″ | ″ | variety |
76 | ″ | ″ | vehicle routing problem |
77 | ″ | ″ | vehicles |
78 | ″ | ″ | warehouse |
79 | ″ | schema:name | A Hybrid Algorithm for Solving the General Vehicle Routing Problem in the Case of the Urban Freight Distribution |
80 | ″ | schema:pagination | 463-475 |
81 | ″ | schema:productId | N5a0841bd5c264fcd8f090d34645a5da9 |
82 | ″ | ″ | N65f3e2a3c0034b7b94e745740572a4c5 |
83 | ″ | schema:publisher | N704ed1b3b60b477da5d07fe239fb0aa4 |
84 | ″ | schema:sameAs | https://app.dimensions.ai/details/publication/pub.1005152098 |
85 | ″ | ″ | https://doi.org/10.1007/978-3-319-04630-3_34 |
86 | ″ | schema:sdDatePublished | 2022-05-10T10:36 |
87 | ″ | schema:sdLicense | https://scigraph.springernature.com/explorer/license/ |
88 | ″ | schema:sdPublisher | N356e2957ee1d453b830e10817c4d93f4 |
89 | ″ | schema:url | https://doi.org/10.1007/978-3-319-04630-3_34 |
90 | ″ | sgo:license | sg:explorer/license/ |
91 | ″ | sgo:sdDataset | chapters |
92 | ″ | rdf:type | schema:Chapter |
93 | N0830f27bd90a43e391c30998d3ddd81b | rdf:first | Neae1718a94c54134ae9e4f97bedcc543 |
94 | ″ | rdf:rest | rdf:nil |
95 | N1cca286976cb491b8f1bf9cc1e801bc3 | rdf:first | sg:person.014021007731.39 |
96 | ″ | rdf:rest | N5a8f317f92d14d8fa5606419405d148a |
97 | N356e2957ee1d453b830e10817c4d93f4 | schema:name | Springer Nature - SN SciGraph project |
98 | ″ | rdf:type | schema:Organization |
99 | N44d99aa5c6724b509f13b979a1e13922 | schema:isbn | 978-3-319-04629-7 |
100 | ″ | ″ | 978-3-319-04630-3 |
101 | ″ | schema:name | Computer-based Modelling and Optimization in Transportation |
102 | ″ | rdf:type | schema:Book |
103 | N4bdcac4922de48758d329c7be9313d57 | schema:familyName | de Sousa |
104 | ″ | schema:givenName | Jorge Freire |
105 | ″ | rdf:type | schema:Person |
106 | N5a0841bd5c264fcd8f090d34645a5da9 | schema:name | dimensions_id |
107 | ″ | schema:value | pub.1005152098 |
108 | ″ | rdf:type | schema:PropertyValue |
109 | N5a8f317f92d14d8fa5606419405d148a | rdf:first | sg:person.012404521747.00 |
110 | ″ | rdf:rest | N82bfd8fb32994011b6ae92ba3442be49 |
111 | N63d77e0cbb2e460c83c0c33ff0b8b043 | rdf:first | Nfa48b5ed36db496f9f94646af4d06e84 |
112 | ″ | rdf:rest | rdf:nil |
113 | N65f3e2a3c0034b7b94e745740572a4c5 | schema:name | doi |
114 | ″ | schema:value | 10.1007/978-3-319-04630-3_34 |
115 | ″ | rdf:type | schema:PropertyValue |
116 | N704ed1b3b60b477da5d07fe239fb0aa4 | schema:name | Springer Nature |
117 | ″ | rdf:type | schema:Organisation |
118 | N82bfd8fb32994011b6ae92ba3442be49 | rdf:first | sg:person.014125600437.78 |
119 | ″ | rdf:rest | N0830f27bd90a43e391c30998d3ddd81b |
120 | Nba70fd7751d44e4a831896f5bb8e56ce | rdf:first | sg:person.016663220241.96 |
121 | ″ | rdf:rest | N1cca286976cb491b8f1bf9cc1e801bc3 |
122 | Nd1279b048a3c41e4ac70511e5c49cfe7 | rdf:first | N4bdcac4922de48758d329c7be9313d57 |
123 | ″ | rdf:rest | N63d77e0cbb2e460c83c0c33ff0b8b043 |
124 | Neae1718a94c54134ae9e4f97bedcc543 | schema:affiliation | grid-institutes:grid.11205.37 |
125 | ″ | schema:familyName | Medrano |
126 | ″ | schema:givenName | Jesús |
127 | ″ | rdf:type | schema:Person |
128 | Nfa48b5ed36db496f9f94646af4d06e84 | schema:familyName | Rossi |
129 | ″ | schema:givenName | Riccardo |
130 | ″ | rdf:type | schema:Person |
131 | anzsrc-for:08 | schema:inDefinedTermSet | anzsrc-for: |
132 | ″ | schema:name | Information and Computing Sciences |
133 | ″ | rdf:type | schema:DefinedTerm |
134 | anzsrc-for:0802 | schema:inDefinedTermSet | anzsrc-for: |
135 | ″ | schema:name | Computation Theory and Mathematics |
136 | ″ | rdf:type | schema:DefinedTerm |
137 | sg:person.012404521747.00 | schema:affiliation | grid-institutes:grid.11205.37 |
138 | ″ | schema:familyName | Royo |
139 | ″ | schema:givenName | Beatriz |
140 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012404521747.00 |
141 | ″ | rdf:type | schema:Person |
142 | sg:person.014021007731.39 | schema:affiliation | grid-institutes:grid.16189.37 |
143 | ″ | schema:familyName | Escuín |
144 | ″ | schema:givenName | David |
145 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014021007731.39 |
146 | ″ | rdf:type | schema:Person |
147 | sg:person.014125600437.78 | schema:affiliation | grid-institutes:grid.11205.37 |
148 | ″ | schema:familyName | Larrodé |
149 | ″ | schema:givenName | Emilio |
150 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014125600437.78 |
151 | ″ | rdf:type | schema:Person |
152 | sg:person.016663220241.96 | schema:affiliation | grid-institutes:grid.11205.37 |
153 | ″ | schema:familyName | Sicilia |
154 | ″ | schema:givenName | Juan-Antonio |
155 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016663220241.96 |
156 | ″ | rdf:type | schema:Person |
157 | grid-institutes:grid.11205.37 | schema:alternateName | Department of Mechanical Engineering, University of Zaragoza, María de Luna 3, 50018, Zaragoza, Spain |
158 | ″ | schema:name | Department of Mechanical Engineering, University of Zaragoza, María de Luna 3, 50018, Zaragoza, Spain |
159 | ″ | rdf:type | schema:Organization |
160 | grid-institutes:grid.16189.37 | schema:alternateName | Instituto Tecnológico de Aragón, María de Luna 1, 50018, Zaragoza, Spain |
161 | ″ | schema:name | Instituto Tecnológico de Aragón, María de Luna 1, 50018, Zaragoza, Spain |
162 | ″ | rdf:type | schema:Organization |