Skip to content

Solving a cars assembly line NP problem by implementing three algorithmic approaches: an exhaustive search, a greedy algorithm and a metaheuristic. ๐Ÿš—

Notifications You must be signed in to change notification settings

alex21th/assembly-line

Folders and files

NameName
Last commit message
Last commit date

Latest commit

ย 

History

1 Commit
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 

Repository files navigation

Cars assembly line problem

Authors

Alex Carrillo Alza

Info

"AP3 - 2018 Project", ALGORITHM AND PROGRAMMING III

2nd, GCED (Degree in Data Science and Engineering)

Contents

Solving a cars assembly line problem by implementing three algorithmic approaches: an exhaustive search, a greedy algorithm and a metaheuristic.

Codes:

  • exh.cc (exhaustive search)
  • greedy (greedy algorithm)
  • mh.cc (metaheuristic)

In order to check that your solutions are correct, you can use the checker we provide: check.

The solve script automaticallly executes each easy, med and hard public benchs and saves all the solutions found by each of the 3 approaches.

About

Solving a cars assembly line NP problem by implementing three algorithmic approaches: an exhaustive search, a greedy algorithm and a metaheuristic. ๐Ÿš—

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published