An evolutionary approach to time constrained routing problems:
Abstract: "Routing problems are an important class of planning problems. Usually there are many different constraints and optimization criteria involved, and it is difficult to find general methods for solving routing problems. We propose an evolutionary solver for such planning problems. An in...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1995
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,47 |
| Subjects: | |
| Summary: | Abstract: "Routing problems are an important class of planning problems. Usually there are many different constraints and optimization criteria involved, and it is difficult to find general methods for solving routing problems. We propose an evolutionary solver for such planning problems. An instance of this solver has been tested on a specific routing problem with time constraints. The performance of this evolutionary solver is compared to a biased random solver and a biased hillclimber solver. Results show that the evolutionary solver performs significantly better than the other two solvers." |
| Physical Description: | 12 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011063792 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961115s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)34292300 | ||
| 035 | |a (DE-599)BVBBV011063792 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Kemenade, C. H. M. van |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An evolutionary approach to time constrained routing problems |c C. H. M. van Kemenade ; J. N. Kok |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 95,47 | |
| 520 | 3 | |a Abstract: "Routing problems are an important class of planning problems. Usually there are many different constraints and optimization criteria involved, and it is difficult to find general methods for solving routing problems. We propose an evolutionary solver for such planning problems. An instance of this solver has been tested on a specific routing problem with time constraints. The performance of this evolutionary solver is compared to a biased random solver and a biased hillclimber solver. Results show that the evolutionary solver performs significantly better than the other two solvers." | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Genetic algorithms | |
| 700 | 1 | |a Kok, Joost N. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,47 |w (DE-604)BV008928356 |9 95,47 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007409843 | ||
Record in the Search Index
| _version_ | 1804125552799383552 |
|---|---|
| any_adam_object | |
| author | Kemenade, C. H. M. van Kok, Joost N. |
| author_facet | Kemenade, C. H. M. van Kok, Joost N. |
| author_role | aut aut |
| author_sort | Kemenade, C. H. M. van |
| author_variant | c h m v k chmv chmvk j n k jn jnk |
| building | Verbundindex |
| bvnumber | BV011063792 |
| ctrlnum | (OCoLC)34292300 (DE-599)BVBBV011063792 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01657nam a2200301 cb4500</leader><controlfield tag="001">BV011063792</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961115s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34292300</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011063792</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kemenade, C. H. M. van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An evolutionary approach to time constrained routing problems</subfield><subfield code="c">C. H. M. van Kemenade ; J. N. Kok</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">95,47</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Routing problems are an important class of planning problems. Usually there are many different constraints and optimization criteria involved, and it is difficult to find general methods for solving routing problems. We propose an evolutionary solver for such planning problems. An instance of this solver has been tested on a specific routing problem with time constraints. The performance of this evolutionary solver is compared to a biased random solver and a biased hillclimber solver. Results show that the evolutionary solver performs significantly better than the other two solvers."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Genetic algorithms</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kok, Joost N.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">95,47</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,47</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007409843</subfield></datafield></record></collection> |
| id | DE-604.BV011063792 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:23Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007409843 |
| oclc_num | 34292300 |
| open_access_boolean | |
| physical | 12 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Kemenade, C. H. M. van Verfasser aut An evolutionary approach to time constrained routing problems C. H. M. van Kemenade ; J. N. Kok Amsterdam 1995 12 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,47 Abstract: "Routing problems are an important class of planning problems. Usually there are many different constraints and optimization criteria involved, and it is difficult to find general methods for solving routing problems. We propose an evolutionary solver for such planning problems. An instance of this solver has been tested on a specific routing problem with time constraints. The performance of this evolutionary solver is compared to a biased random solver and a biased hillclimber solver. Results show that the evolutionary solver performs significantly better than the other two solvers." Computer programming Genetic algorithms Kok, Joost N. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,47 (DE-604)BV008928356 95,47 |
| spellingShingle | Kemenade, C. H. M. van Kok, Joost N. An evolutionary approach to time constrained routing problems Computer programming Genetic algorithms |
| title | An evolutionary approach to time constrained routing problems |
| title_auth | An evolutionary approach to time constrained routing problems |
| title_exact_search | An evolutionary approach to time constrained routing problems |
| title_full | An evolutionary approach to time constrained routing problems C. H. M. van Kemenade ; J. N. Kok |
| title_fullStr | An evolutionary approach to time constrained routing problems C. H. M. van Kemenade ; J. N. Kok |
| title_full_unstemmed | An evolutionary approach to time constrained routing problems C. H. M. van Kemenade ; J. N. Kok |
| title_short | An evolutionary approach to time constrained routing problems |
| title_sort | an evolutionary approach to time constrained routing problems |
| topic | Computer programming Genetic algorithms |
| topic_facet | Computer programming Genetic algorithms |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT kemenadechmvan anevolutionaryapproachtotimeconstrainedroutingproblems AT kokjoostn anevolutionaryapproachtotimeconstrainedroutingproblems |