dryuanqimin / lkh3_hamilton Goto Github PK
View Code? Open in Web Editor NEWThis project forked from cerebis/lkh3
Github mirror of Keld Helsgaun's wonderful LKH3 project.
Home Page: http://akira.ruc.dk/~keld/research/LKH-3/
This project forked from cerebis/lkh3
Github mirror of Keld Helsgaun's wonderful LKH3 project.
Home Page: http://akira.ruc.dk/~keld/research/LKH-3/
LKH is an implementation of the Lin-Kernighan traveling salesman heuristic. The code is distributed for research use. The author reserves all rights to the code. INSTRUCTIONS FOR INSTALLATION: (Version 3.0.6 - May 2019) ----------------------------- The software is available in gzipped tar format: LKH-3.0.6.tgz (approximately 2.3 MB) Download the software and execute the following UNIX commands: tar xvfz LKH-3.0.6.tgz cd LKH-3.0.5 make An executable file called LKH will now be available in the directory LKH-3.0.6. To test the installation run the program by typing ./LKH pr2392.par. Then press return. The program should now solve a TSP instance with 2392 nodes. For testing the installation on an mTSP problem, type ./LKH whizzkids96.par. Then press return. A two-level tree is used as the default tour representation. A three-level tree representation may be used instead by compiling the source code with the compiler option -DTHREE_LEVEL_TREE Just edit the first line in SRC/Makefile and execute the commands make clean make CHANGES IN LKH-3.0.6: --------------------- Added code for solving the Steiner traveling salesman problem (STTSP). New keyword REQUIRED_NODES_SECTION CHANGES IN LKH-3.0.5: --------------------- Added code for solving the open close multiple traveling salesman problem (OCMTSP). New keyword EXTERNAL_SALESMEN CHANGES IN LKH-3.0.4: --------------------- Added code for solving the colored traveling saleman problem (CTSP). The node coloring is described in a CTSP_SET_SECTION New initial tour algorithm: CTSP Added code solving the minimum latency problem (MLP). CHANGES IN VERSION 3.0.3: ------------------------- Candidate sets may now be created by means of POPMUSIC by giving the following specification in the parameter file for LKH: CANDIDATE_SET_TYPE = POPMUSIC The value of the parameter MAX_CANDIDATES is used to trim the candidate set. There are, however, some other POPMUSIC related parameters. If not specified, they will take their default values. These parameters are: POPMUSIC_SAMPLE_SIZE = <int> Sample size. Default: 10. POPMUSIC_SOLUTIONS = <int> Number of solutions to generate. Default: 50. POPMUSIC_MAX_NEIGHBORS = <int> Maximum number of nearest neighbors used as candidates in iterated 3-opt for POPMUSIC. Default: 5. POPMUSIC_TRIALS = <int> Number of trials used in iterated 3-opt for POPMUSIC. If the value is zero, the number of trials is the size of the subpath to be optimized. Default: 1. POPMUSIC_INITIAL_TOUR = { YES | NO } Specifies whether the first generated POPMUSIC tour is used as initial tour for Lin-Kernighan. Default: NO. CHANGES IN VERSION 3.0.2: ------------------------- Tours may now be recombined by GPX2 (Generalized Partition Crossover 2) instead of IPT (Iterative Partial Transcription). GPX2 is used by giving the following specification in the parameter file: RECOMBINATION = GPX2 The possible settings are: RECOMBINATION = { IPT | GPX2 } IPT is default. CHANGES IN VERSION 3.0.1: ------------------------- New problem type: TSPDL (traveling salesman with draft limits) NEW IN VERSION 3.0: ------------------- New parameter keywords: BWTSP = <integer> <integer> [ <integer> ] DEPOT = <integer> MAKESPAN = { YES | NO } MTSP_MIN_SIZE = <integer> MTSP_MAX_SIZE = <integer> MTSP_OBJECTIVE = [ MINMAX | MINMAX_SIZE | MINSUM ] MTSP_RESULT_FILE = <string> SINTEF_RESULT_FILE = <string> SALESMEN = <integer> SCALE = <integer> VEHICLES : <integer> New initial tour algorithms: CVRPR MTSP SOP New TSPLIB format keywords: The specification part: CAPACITY : <integer> DEMAND_DIMENSION : <integer> DISTANCE : <real> GRID_SIZE : <real> RISK_THRESHOLD : <integer> SALESMEN : <integer> SCALE : <integer> SERVICE_TIME_SECTION VEHICLES : <integer> New edge weight types: EXACT_2D EXACT_3D FLOOR_2D FLOOR_3D TOR_2D TOR_3D The data part: BACKHAUL_SECTION DEMAND_SECTION DEPOT_SECTION PICKUP_AND_DELIVERY_SECTION TIME_WINDOW_SECTION
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.